Sparsest cuts and concurrent flows in product graphs. (Q1427176)

From MaRDI portal
Revision as of 18:52, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Sparsest cuts and concurrent flows in product graphs.
scientific article

    Statements

    title
    Sparsest cuts and concurrent flows in product graphs. (English)
    0 references
    author
    Paul Bonsma
    0 references
    publication date
    14 March 2004
    0 references
    Mathematics Subject Classification ID
    90B10
    0 references
    68R10
    0 references
    05C99
    0 references
    zbMATH DE Number
    2055503
    0 references
    zbMATH Keywords
    Product graph
    0 references
    Sparsest cut
    0 references
    Concurrent flow
    0 references
    Bottleneck graph
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1427176&oldid=13598075"
    Powered by MediaWiki