An algorithm for enumerating all spanning trees of a directed graph (Q1977130): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2090660215 / rank
 
Normal rank

Latest revision as of 20:08, 19 March 2024

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