ENUMERATING SPANNING AND CONNECTED SUBSETS IN GRAPHS AND MATROIDS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) (Q5385037)

From MaRDI portal
scientific article; zbMATH DE number 5269116
Language Label Description Also known as
English
ENUMERATING SPANNING AND CONNECTED SUBSETS IN GRAPHS AND MATROIDS(&lt;Special Issue&gt;the 50th Anniversary of the Operations Research Society of Japan)
scientific article; zbMATH DE number 5269116

    Statements

    ENUMERATING SPANNING AND CONNECTED SUBSETS IN GRAPHS AND MATROIDS(&lt;Special Issue&gt;the 50th Anniversary of the Operations Research Society of Japan) (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    29 April 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    algorithm
    0 references
    matroid
    0 references
    enumeration
    0 references
    quasi-polynomial
    0 references
    0 references