Constant-factor approximation of the domination number in sparse graphs (Q1943391)

From MaRDI portal
Revision as of 16:54, 1 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Constant-factor approximation of the domination number in sparse graphs
scientific article

    Statements

    Constant-factor approximation of the domination number in sparse graphs (English)
    0 references
    0 references
    19 March 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    linear-time constant-factor algorithm
    0 references
    proper minor-closed graph classes
    0 references
    proper classes closed on topological minors
    0 references