Counting minimal transversals of \(\beta\)-acyclic hypergraphs (Q1713476)
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: Counting minimal transversals of -acyclic hypergraphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting minimal transversals of \(\beta\)-acyclic hypergraphs |
scientific article |
Statements
Counting minimal transversals of \(\beta\)-acyclic hypergraphs (English)
0 references
25 January 2019
0 references
counting problem
0 references
minimal transversals
0 references
dominating sets
0 references
\(\beta\)-acyclic hypergraphs
0 references
strongly chordal graphs
0 references
0 references
0.7783512473106384
0 references
0.7772398591041565
0 references
0.7626327276229858
0 references
0.7626327276229858
0 references
0.7614524364471436
0 references
