Routing flow through a strongly connected graph (Q1348945)

From MaRDI portal
Revision as of 18:34, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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 Keywords
    binary blocking flow algorithm
    0 references
    author
    Erlebach, Thomas
    0 references
    Torben Hagerup
    0 references

    Identifiers

    zbMATH DE Number
    1742804
    0 references
    OpenAlex ID
    W60910956
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1348945&oldid=38632644"
    Powered by MediaWiki