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

From MaRDI portal
Revision as of 04:18, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Sparsest cuts and concurrent flows in product graphs.
scientific article

    Statements

    Sparsest cuts and concurrent flows in product graphs. (English)
    0 references
    0 references
    14 March 2004
    0 references
    0 references
    0 references
    0 references
    0 references
    Product graph
    0 references
    Sparsest cut
    0 references
    Concurrent flow
    0 references
    Bottleneck graph
    0 references