Two Algorithms for Unranking Arborescences (Q4876694)

From MaRDI portal
Revision as of 02:27, 11 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 874102
Language Label Description Also known as
English
Two Algorithms for Unranking Arborescences
scientific article; zbMATH DE number 874102

    Statements

    Two Algorithms for Unranking Arborescences (English)
    0 references
    0 references
    0 references
    0 references
    4 June 1996
    0 references
    0 references
    rooted spanning arborescences
    0 references
    directed graph
    0 references