language-icon Old Web
English
Sign In
Acemap > Paper > Improved lower bounds for the 2-page crossing number of Km, n and Kn via semidefinite programming

Improved lower bounds for the 2-page crossing number of Km, n and Kn via semidefinite programming

2012 
Keywords:
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    0
    References
    0
    Citations
    NaN
    KQI
    []
    logo
    • CCF Conference Analysis
    • Map Galaxy
    • What's New
    © Copyright 2015-2020 Acemap, Inc. Shanghai Jiao Tong University.