The complexity of finding arc-disjoint branching flows (Q298947)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The complexity of finding arc-disjoint branching flows
scientific article

    Statements

    The complexity of finding arc-disjoint branching flows (English)
    0 references
    0 references
    0 references
    0 references
    21 June 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    disjoint branchings
    0 references
    branching flow
    0 references
    polynomial algorithm
    0 references
    NP-completeness
    0 references
    0 references