A simple linear time algorithm for the domatic partition problem on strongly chordal graphs (Q1195488)
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: A simple linear time algorithm for the domatic partition problem on strongly chordal graphs |
scientific article; zbMATH DE number 69905
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple linear time algorithm for the domatic partition problem on strongly chordal graphs |
scientific article; zbMATH DE number 69905 |
Statements
A simple linear time algorithm for the domatic partition problem on strongly chordal graphs (English)
0 references
29 November 1992
0 references
linear time algorithm
0 references
domatic partition problem
0 references
NP-hard
0 references
strongly chordal graph
0 references
dominating sets
0 references
0.92149925
0 references
0.9202269
0 references
0.9142635
0 references
0.9030572
0 references
0.9017284
0 references
0.8977384
0 references
0.8946114
0 references
