Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs (Q988694)

From MaRDI portal
Revision as of 02:03, 3 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
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
scientific article

    Statements

    Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs (English)
    0 references
    0 references
    0 references
    18 August 2010
    0 references
    parameterized complexity
    0 references
    planar graphs
    0 references
    subexponential algorithm
    0 references
    branch decomposition
    0 references
    graph minors
    0 references
    bidimensionality
    0 references
    Catalan structures
    0 references

    Identifiers