On the Complexity of Some Enumeration Problems for Matroids (Q5470804)

From MaRDI portal
Revision as of 21:37, 27 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5029665
Language Label Description Also known as
English
On the Complexity of Some Enumeration Problems for Matroids
scientific article; zbMATH DE number 5029665

    Statements

    On the Complexity of Some Enumeration Problems for Matroids (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    1 June 2006
    0 references
    incremental polynomial time
    0 references
    base
    0 references
    circuit
    0 references
    flat
    0 references
    hyperplane
    0 references
    hypergraph
    0 references
    Steiner tree
    0 references
    multiway cut
    0 references

    Identifiers