On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow (Q5119381)

From MaRDI portal
scientific article; zbMATH DE number 7243663
Language Label Description Also known as
English
On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow
scientific article; zbMATH DE number 7243663

    Statements

    On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow (English)
    0 references
    0 references
    0 references
    0 references
    4 September 2020
    0 references
    exponential length method
    0 references
    maximum \(L\)-bounded flow problem
    0 references
    0 references
    0 references

    Identifiers