Maximal irredundant set enumeration in bounded-degeneracy and bounded-degree hypergraphs (Q2301741)

From MaRDI portal
Revision as of 21:31, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Maximal irredundant set enumeration in bounded-degeneracy and bounded-degree hypergraphs
scientific article

    Statements

    Maximal irredundant set enumeration in bounded-degeneracy and bounded-degree hypergraphs (English)
    0 references
    0 references
    0 references
    0 references
    25 February 2020
    0 references
    irredundant sets
    0 references
    enumeration algorithms
    0 references
    FPT
    0 references
    polynomial delay
    0 references

    Identifiers