Laying Out Sparse Graphs with Provably Minimum Bandwidth (Q2890478)

From MaRDI portal
Revision as of 01:15, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Laying Out Sparse Graphs with Provably Minimum Bandwidth
scientific article

    Statements

    title
    Laying Out Sparse Graphs with Provably Minimum Bandwidth (English)
    0 references
    publication date
    8 June 2012
    0 references
    zbMATH Keywords
    integer programming
    0 references
    branch and bound programming
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C57
    0 references
    90C35
    0 references
    90C10
    0 references
    zbMATH DE Number
    6044619
    0 references
    OpenAlex ID
    W2049628958
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2890478&oldid=32749237"
    Powered by MediaWiki