An algorithm for enumerating all spanning trees of a directed graph (Q1977130)

From MaRDI portal
Revision as of 01:05, 30 July 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
An algorithm for enumerating all spanning trees of a directed graph
scientific article

    Statements

    An algorithm for enumerating all spanning trees of a directed graph (English)
    0 references
    0 references
    0 references
    0 references
    18 December 2000
    0 references
    spanning trees
    0 references
    directed graph
    0 references

    Identifiers