Disjoint paths in sparse graphs (Q967419)

From MaRDI portal
Revision as of 10:26, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Disjoint paths in sparse graphs
scientific article

    Statements

    title
    Disjoint paths in sparse graphs (English)
    0 references
    author
    Cédric Bentz
    0 references
    publication date
    28 April 2010
    0 references
    zbMATH Keywords
    disjoint paths
    0 references
    approximation algorithms
    0 references
    polynomial-time solvability
    0 references
    planar graphs
    0 references
    bounded tree-width
    0 references
    cites work
    Q4734761
    0 references
    Q4471352
    0 references
    Q3002769
    0 references
    Q4393480
    0 references
    Q4779157
    0 references
    Q3972951
    0 references
    Q4231910
    0 references
    Q3840354
    0 references
    Q4828931
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C85
    0 references
    05C38
    0 references
    68W25
    0 references
    zbMATH DE Number
    5702670
    0 references
    OpenAlex ID
    W1971175938
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q967419&oldid=38557000"
    Powered by MediaWiki