Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs (Q3508549): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-540-74839-7_1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1848715483 / rank | |||
Normal rank | |||
Revision as of 00:37, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs |
scientific article |
Statements
Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs (English)
0 references
1 July 2008
0 references
Computational complexity
0 references
graph algorithms
0 references
