Enumerating minimal dominating sets in chordal bipartite graphs (Q896653)
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 6519402
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enumerating minimal dominating sets in chordal bipartite graphs |
scientific article; zbMATH DE number 6519402 |
Statements
Enumerating minimal dominating sets in chordal bipartite graphs (English)
0 references
10 December 2015
0 references
minimal dominating set
0 references
enumeration
0 references
output polynomial algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.876767098903656
0 references
0.8546714186668396
0 references
0.8542777299880981
0 references
0.8540841937065125
0 references
0.8532625436782837
0 references
