An Almost Linear-Time Algorithm for Graph Realization (Q3800056)

From MaRDI portal
Revision as of 15:17, 5 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
An Almost Linear-Time Algorithm for Graph Realization
scientific article

    Statements

    title
    An Almost Linear-Time Algorithm for Graph Realization (English)
    0 references
    DOI
    10.1287/moor.13.1.99
    0 references
    author
    Robert E. Bixby
    0 references
    Donald K. Wagner
    0 references
    publication date
    1988
    0 references
    zbMATH DE Number
    4066914
    0 references
    zbMATH Keywords
    planarity testing
    0 references
    network structure
    0 references
    graph-realization problem
    0 references
    tree
    0 references
    algorithm
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3800056&oldid=17369459"
    Powered by MediaWiki