Complexity of finding k-path-free dominating sets in graphs (Q1167535): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Reuven Bar Yehuda / rank | |||
Property / author | |||
Property / author: Uzi Vishkin / rank | |||
Property / author | |||
Property / author: Reuven Bar Yehuda / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Uzi Vishkin / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0020-0190(82)90021-7 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2089836190 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4050630 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4065548 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5672651 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3883524 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5581642 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5585195 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Problems and methods with multiple objective functions / rank | |||
Normal rank |
Latest revision as of 16:29, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Complexity of finding k-path-free dominating sets in graphs |
scientific article |
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