Spanners in sparse graphs (Q657919)

From MaRDI portal
Revision as of 20:26, 4 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
Spanners in sparse graphs
scientific article

    Statements

    title
    Spanners in sparse graphs (English)
    0 references
    author
    Feodor F. Dragan
    0 references
    Fedor V. Fomin
    0 references
    Petr A. Golovach
    0 references
    publication date
    11 January 2012
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    05C12
    0 references
    05C85
    0 references
    zbMATH DE Number
    5996370
    0 references
    zbMATH Keywords
    graph algorithms
    0 references
    parametrized complexity
    0 references
    spanners
    0 references
    distance in graphs
    0 references
    planar graphs
    0 references
    apex-minor-free graphs
    0 references
    treewidth
    0 references
    OpenAlex ID
    W1980466385
    0 references
    Wikidata QID
    Q60488576
    0 references
    cites work
    Q4527040
    0 references
    (Meta) Kernelization
    0 references
    Q3836515
    0 references
    Tree Spanners
    0 references
    Q5315023
    0 references
    Q4393480
    0 references
    Q2726740
    0 references
    Q5710169
    0 references
    Q4708559
    0 references
    Graph spanners
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q657919&oldid=35261643"
    Powered by MediaWiki