Finding a feasible flow in a strongly connected network (Q1003481)

From MaRDI portal
Revision as of 19:34, 18 April 2024 by Importer (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Finding a feasible flow in a strongly connected network
scientific article

    Statements

    title
    Finding a feasible flow in a strongly connected network (English)
    0 references
    author
    Bernhard Haeupler
    0 references
    Robert Endre Tarjan
    0 references
    publication date
    4 March 2009
    0 references
    zbMATH DE Number
    5522975
    0 references
    zbMATH Keywords
    combinatorial algorithms
    0 references
    network flow
    0 references
    feasible flow
    0 references
    strongly connected network
    0 references
    maximum flow
    0 references
    OpenAlex ID
    W1525978089
    0 references
    arXiv ID
    0711.2710
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1003481&oldid=33375017"
    Powered by MediaWiki