Computing a minimum outer-connected dominating set for the class of chordal graphs (Q2444768)

From MaRDI portal
Revision as of 02:18, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Computing a minimum outer-connected dominating set for the class of chordal graphs
scientific article

    Statements

    Computing a minimum outer-connected dominating set for the class of chordal graphs (English)
    0 references
    0 references
    0 references
    11 April 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    graph algorithms
    0 references
    domination
    0 references
    outer-connected domination
    0 references
    proper interval graph
    0 references
    doubly chordal graph
    0 references
    undirected path graph
    0 references
    NP-complete
    0 references
    0 references