A strengthened analysis of an algorithm for dominating set in planar graphs (Q415281)

From MaRDI portal
Revision as of 01:10, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
A strengthened analysis of an algorithm for dominating set in planar graphs
scientific article

    Statements

    A strengthened analysis of an algorithm for dominating set in planar graphs (English)
    0 references
    0 references
    11 May 2012
    0 references
    dominating set
    0 references
    planar graph
    0 references
    parameterized complexity
    0 references

    Identifiers