Simple undirected two-commodity integral flow with a unitary demand

DOI10.1016/J.ENDM.2017.10.048MaRDI QIDQ2413185zbMATH OpenOpenAlexFDO

Authors Alexsander A. Melo, Uéverton S. Souza, C. 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

\(k + 1\) disjoint pathsedge-disjoint pathstwo-commodity flowundirected flowunitary demandvertex-disjoint paths

Mathematics Subject Classification ID

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

Recommendations

• Publication:3471824
• STACS 2004
• On the integral plane two-commodity flow problem
• Optimal Two-commodity Flows with Non-linear Cost Functions
• Consumer buying dynamics for a single commodity using flow and stock utilities and a principle of minimum total utility imbalance
• Equilibrium flow assignment in a single-commodity network
• (Almost) Tight bounds and existence theorems for single-commodity confluent flows
• Variable demand and multi-commodity flow in Markovian network equilibrium
• Equilibrium Supply-Demand Allocation in a Single-Commodity Network
• Multicommodity flows in simple multistage networks

Cites work

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

Cited in

(2)

• scientific article; zbMATH DE number 840702 (Why is no real title available?)
• On undirected two‐commodity integral flow, disjoint paths and strict terminal connection problems

This page was built for publication: Simple undirected two-commodity integral flow with a unitary demand

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2413185)