On the Complexity of Some Enumeration Problems for Matroids (Q5470804): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1137/s0895480103428338 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2086542011 / rank
 
Normal rank

Latest revision as of 08:21, 30 July 2024

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