Recognizing optimal 1-planar graphs in linear time (Q1702117)

From MaRDI portal
Revision as of 06:29, 15 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
Recognizing optimal 1-planar graphs in linear time
scientific article

    Statements

    title
    Recognizing optimal 1-planar graphs in linear time (English)
    0 references
    published in
    Algorithmica
    0 references
    publication date
    28 February 2018
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    05C85
    0 references
    68Q25
    0 references
    zbMATH DE Number
    6844593
    0 references
    zbMATH Keywords
    graph drawing
    0 references
    1-planar graphs
    0 references
    recognition algorithms
    0 references
    graph reduction systems
    0 references
    OpenAlex ID
    W2531380780
    0 references
    arXiv ID
    1602.08022
    0 references
    cites work
    Outer 1-planar graphs
    0 references
    Map graphs
    0 references
    Q3699704
    0 references
    Q4472293
    0 references
    Q4702188
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1702117&oldid=36375861"
    Powered by MediaWiki