A linear-time algorithm for testing outer-1-planarity (Q494794)

From MaRDI portal
Revision as of 17:48, 10 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A linear-time algorithm for testing outer-1-planarity
scientific article

    Statements

    title
    A linear-time algorithm for testing outer-1-planarity (English)
    0 references
    author
    Seok-Hee Hong
    0 references
    Peter Eades
    0 references
    Naoki Katoh
    0 references
    Giuseppe Liotta
    0 references
    Pascal Schweitzer
    0 references
    Yusuke Suzuki
    0 references
    published in
    Algorithmica
    0 references
    publication date
    2 September 2015
    0 references
    zbMATH Keywords
    graph drawing
    0 references
    1-planar graphs
    0 references
    outer 1-planar graphs
    0 references
    1-planarity
    0 references
    1-planar embedding
    0 references
    cites work
    Q3679212
    0 references
    Q3699704
    0 references
    Q4472293
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    05C10
    0 references
    05C85
    0 references
    zbMATH DE Number
    6477666
    0 references
    OpenAlex ID
    W2159869336
    0 references
    Wikidata QID
    Q62042391
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q494794&oldid=36198757"
    Powered by MediaWiki