Simple undirected two-commodity integral flow with a unitary demand

DOI10.1016/j.endm.2017.10.048zbMath1383.05138OpenAlexW2766585005MaRDI QIDQ2413185

Uéverton S. Souza, Alexsander A. Melo, Celina M. H. Figueiredo

Publication date: 9 April 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.10.048

zbMATH Keywords

edge-disjoint pathsvertex-disjoint pathstwo-commodity flowunitary demand\(k + 1\) disjoint pathsundirected flow

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Flows in graphs (05C21)

Related Items

On undirected two‐commodity integral flow, disjoint paths and strict terminal connection problems

Cites Work

• Unnamed Item
• The disjoint paths problem in quadratic time
• The directed subgraph homeomorphism problem
• The disjoint shortest paths problem
• Graph minors. XIII: The disjoint paths problem
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• On the Computational Complexity of Combinatorial Problems
• On the Complexity of Timetable and Multicommodity Flow Problems
• Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph