Routing flow through a strongly connected graph (Q1348945)

From MaRDI portal
Revision as of 23:25, 9 February 2024 by RedirectionBot (talk | contribs) (‎Removed claims)
scientific article
Language Label Description Also known as
English
Routing flow through a strongly connected graph
scientific article

    Statements

    title
    Routing flow through a strongly connected graph (English)
    0 references
    published in
    Algorithmica
    0 references
    publication date
    21 May 2002
    0 references
    zbMATH DE Number
    1742804
    0 references
    zbMATH Keywords
    binary blocking flow algorithm
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1348945&oldid=20320112"
    Powered by MediaWiki