Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs (Q3508549)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5294891
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs |
scientific article; zbMATH DE number 5294891 |
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
0.8789953589439392
0 references
0.8757498264312744
0 references
0.8229416608810425
0 references
0.8211113810539246
0 references
