Computational Study for Planar Connected Dominating Set Problem (Q3066449)

From MaRDI portal
Revision as of 12:26, 21 January 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q60402521, #quickstatements; #temporary_batch_1705835156834)
scientific article
Language Label Description Also known as
English
Computational Study for Planar Connected Dominating Set Problem
scientific article

    Statements

    Computational Study for Planar Connected Dominating Set Problem (English)
    0 references
    0 references
    0 references
    0 references
    10 January 2011
    0 references
    branch-decomposition based algorithms
    0 references
    CDS problem
    0 references
    planar graphs
    0 references
    fixed-parameter algorithms
    0 references
    computational study
    0 references

    Identifiers