Complexity of computation of a spanning tree enumeration algorithm (Q3341895)

From MaRDI portal
Revision as of 14:09, 4 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Complexity of computation of a spanning tree enumeration algorithm
scientific article

    Statements

    Complexity of computation of a spanning tree enumeration algorithm (English)
    0 references
    0 references
    0 references
    1984
    0 references
    spanning tree enumeration algorithm
    0 references
    complexity analysis of Char's algorithm
    0 references
    speed up
    0 references
    path compression
    0 references

    Identifiers