A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs (Q5261054): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1142/s1793830915500202 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2095423548 / rank | |||
Normal rank | |||
Latest revision as of 08:23, 30 July 2024
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
0 references
