A faster algorithm for finding edge-disjoint branchings (Q1838313)

From MaRDI portal
Revision as of 18:37, 13 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A faster algorithm for finding edge-disjoint branchings
scientific article

    Statements

    title
    A faster algorithm for finding edge-disjoint branchings (English)
    0 references
    author
    Po Tong
    0 references
    Eugene L. Lawler
    0 references
    publication date
    1983
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    68Q25
    0 references
    05C40
    0 references
    zbMATH DE Number
    3804866
    0 references
    zbMATH Keywords
    directed multigraph
    0 references
    constructive proof of Edmonds' branchings theorem
    0 references
    edge-connectivity
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1838313&oldid=34680259"
    Powered by MediaWiki