The complexity of finding arc-disjoint branching flows (Q298947): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2015.10.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2181756921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Arc-)disjoint flows in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced branchings in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: FPT algorithms and kernels for the directed \(k\)-leaf problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur les arborescences dans un graphe oriente / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Directed Degree-Preserving Spanning Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two minimax theorems in graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroid theory and its applications in electric network theory and in statics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On covering intersecting set-systems by digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering a strong digraph by \(\alpha-1\) disjoint paths: A proof of Las Vergnas' conjecture / rank
 
Normal rank

Latest revision as of 05:33, 12 July 2024

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