Enumerating minimal dominating sets in chordal graphs (Q738877)
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 dominating sets in chordal graphs |
scientific article; zbMATH DE number 6617212
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enumerating minimal dominating sets in chordal graphs |
scientific article; zbMATH DE number 6617212 |
Statements
Enumerating minimal dominating sets in chordal graphs (English)
0 references
16 August 2016
0 references
input sensitive enumeration
0 references
branching algorithm
0 references
maximum number of minimal dominating sets
0 references
chordal graphs
0 references
graph algorithms
0 references
0.9338358044624328
0 references
0.8937746286392212
0 references
0.8867500424385071
0 references
0.8538706302642822
0 references
0.8312661051750183
0 references
