New analysis and computational study for the planar connected dominating set problem (Q328712)

From MaRDI portal
Revision as of 21:12, 7 February 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q60402182, #quickstatements; #temporary_batch_1707336753642)
scientific article
Language Label Description Also known as
English
New analysis and computational study for the planar connected dominating set problem
scientific article

    Statements

    New analysis and computational study for the planar connected dominating set problem (English)
    0 references
    0 references
    0 references
    0 references
    20 October 2016
    0 references
    branch-decomposition based algorithms
    0 references
    connected dominating set
    0 references
    planar graphs
    0 references
    fixed-parameter algorithms
    0 references
    computational study
    0 references

    Identifiers