MOD-CHAR: an implementation of Char's spanning tree enumeration algorithm and its complexity analysis (Q4733403)

From MaRDI portal
Revision as of 23:45, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 4119622
Language Label Description Also known as
English
MOD-CHAR: an implementation of Char's spanning tree enumeration algorithm and its complexity analysis
scientific article; zbMATH DE number 4119622

    Statements

    MOD-CHAR: an implementation of Char's spanning tree enumeration algorithm and its complexity analysis (English)
    0 references
    0 references
    0 references
    0 references
    1989
    0 references
    0 references
    0 references
    0 references
    0 references
    spanning tree
    0 references
    enumeration problems
    0 references
    0 references