Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs (Q1849745)

From MaRDI portal
Revision as of 09:30, 28 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
scientific article

    Statements

    Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    1 December 2002
    0 references
    NP-complete problems
    0 references
    fixed parameter tractability
    0 references
    planar graphs
    0 references
    planar dominating set
    0 references
    face cover
    0 references
    outerplanarity
    0 references
    treewidth
    0 references

    Identifiers