A parametric maximum flow algorithm for bipartite graphs with applications (Q1129980)

From MaRDI portal
Revision as of 19:18, 13 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A parametric maximum flow algorithm for bipartite graphs with applications
scientific article

    Statements

    A parametric maximum flow algorithm for bipartite graphs with applications (English)
    0 references
    0 references
    16 August 1998
    0 references
    bipartite graph
    0 references
    maximum flow
    0 references
    parametric algorithm
    0 references
    capacitated bipartite network
    0 references

    Identifiers