A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs (Q5261054)
From MaRDI portal
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
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