Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs (Q3508549): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:15, 5 February 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
