Complexity of finding k-path-free dominating sets in graphs (Q1167535)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity of finding k-path-free dominating sets in graphs |
scientific article; zbMATH DE number 3772948
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of finding k-path-free dominating sets in graphs |
scientific article; zbMATH DE number 3772948 |
Statements
Complexity of finding k-path-free dominating sets in graphs (English)
0 references
1982
0 references
graph algorithms
0 references
NP-completeness
0 references
dominating set
0 references
tournament
0 references
satisfiability problem
0 references
directed graph
0 references
