An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs (Q4337655)

From MaRDI portal
Revision as of 08:56, 28 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1012892
Language Label Description Also known as
English
An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
scientific article; zbMATH DE number 1012892

    Statements

    An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs (English)
    0 references
    0 references
    0 references
    0 references
    26 May 1997
    0 references
    0 references
    0 references
    0 references
    0 references
    optimal algorithm
    0 references
    spanning trees
    0 references
    undirected graphs
    0 references