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

From MaRDI portal
Revision as of 20:08, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(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

    title
    An algorithm for enumerating all spanning trees of a directed graph (English)
    0 references
    author
    Sanjiv Kapoor
    0 references
    H. Ramesh
    0 references
    published in
    Algorithmica
    0 references
    publication date
    18 December 2000
    0 references
    zbMATH Keywords
    spanning trees
    0 references
    directed graph
    0 references

    Identifiers

    DOI
    10.1007/s004530010008
    0 references
    zbMATH DE Number
    1444106
    0 references
    OpenAlex ID
    W2090660215
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1977130&oldid=31687998"
    Powered by MediaWiki