A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs (Q5261054)

From MaRDI portal
Revision as of 09:23, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6454691
Language Label Description Also known as
English
A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs
scientific article; zbMATH DE number 6454691

    Statements

    A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs (English)
    0 references
    1 July 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    domination
    0 references
    restrained domination
    0 references
    proper interval graphs
    0 references
    undirected path graphs
    0 references
    chordal bipartite graphs
    0 references
    circle graphs
    0 references
    planar graphs
    0 references
    NP-complete
    0 references
    0 references