Maximal irredundant set enumeration in bounded-degeneracy and bounded-degree hypergraphs (Q2301741)
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: Maximal irredundant set enumeration in bounded-degeneracy and bounded-degree hypergraphs |
scientific article; zbMATH DE number 7173528
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximal irredundant set enumeration in bounded-degeneracy and bounded-degree hypergraphs |
scientific article; zbMATH DE number 7173528 |
Statements
Maximal irredundant set enumeration in bounded-degeneracy and bounded-degree hypergraphs (English)
0 references
25 February 2020
0 references
irredundant sets
0 references
enumeration algorithms
0 references
FPT
0 references
polynomial delay
0 references
0.7809218168258667
0 references
0.780921459197998
0 references
0.7199199199676514
0 references
0.7197663187980652
0 references
0.7185443043708801
0 references
