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

From MaRDI portal
Revision as of 01:02, 4 September 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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