Routing flow through a strongly connected graph (Q1348945)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Routing flow through a strongly connected graph
scientific article

    Statements

    Routing flow through a strongly connected graph (English)
    0 references
    0 references
    21 May 2002
    0 references
    0 references
    binary blocking flow algorithm
    0 references
    0 references
    0 references
    0 references