Improved Lower Bounds for the 2-Page Crossing Numbers of $K_{m,n}$ and $K_n$ via Semidefinite Programming (Q2910885)

From MaRDI portal
Revision as of 10:49, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Improved Lower Bounds for the 2-Page Crossing Numbers of $K_{m,n}$ and $K_n$ via Semidefinite Programming
scientific article

    Statements

    Improved Lower Bounds for the 2-Page Crossing Numbers of $K_{m,n}$ and $K_n$ via Semidefinite Programming (English)
    0 references
    0 references
    0 references
    0 references
    12 September 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    2-page crossing number
    0 references
    book crossing number
    0 references
    maximum cut
    0 references
    Goemans-Williamson max-cut bound
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references