Enumerating minimal connected dominating sets in graphs of bounded chordality (Q278724)
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: Enumerating minimal connected dominating sets in graphs of bounded chordality |
scientific article; zbMATH DE number 6576258
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Enumerating minimal connected dominating sets in graphs of bounded chordality |
scientific article; zbMATH DE number 6576258 |
Statements
Enumerating minimal connected dominating sets in graphs of bounded chordality (English)
0 references
2 May 2016
0 references
exact exponential algorithms
0 references
enumeration
0 references
minimal connected dominating sets
0 references
1.0000002
0 references
0.9839616
0 references
0 references
0.96175027
0 references
0.95985776
0 references
0.9310886
0 references
0.9291625
0 references
0.9291625
0 references
0.91765666
0 references
