A SIMPLE HEURISTIC FOR MINIMUM CONNECTED DOMINATING SET IN GRAPHS (Q5696912)

From MaRDI portal
Revision as of 03:33, 1 December 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 2216284
Language Label Description Also known as
English
A SIMPLE HEURISTIC FOR MINIMUM CONNECTED DOMINATING SET IN GRAPHS
scientific article; zbMATH DE number 2216284

    Statements

    A SIMPLE HEURISTIC FOR MINIMUM CONNECTED DOMINATING SET IN GRAPHS (English)
    0 references
    0 references
    0 references
    0 references
    19 October 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    connected dominating set
    0 references
    2-independent set
    0 references
    minor
    0 references
    approximation algorithm
    0 references