Free multiflows in bidirected and skew-symmetric graphs

DOI10.1016/j.dam.2007.02.012zbMath1152.90574arXivmath/0510463OpenAlexW2082728157MaRDI QIDQ2381535

Maxim A. Babenko, Alexander V. Karzanov

Publication date: 18 September 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0510463

zbMATH Keywords

edge-disjoint pathsbidirected graphmultiflowskew-symmetric graph

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items

Min-cost multiflows in node-capacitated undirected networks, On flows in simple bidirected and skew-symmetric networks, A fast algorithm for the path 2-packing problem, Minimum mean cycle problem in bidirected and skew-symmetric graphs

Cites Work

• The directed subgraph homeomorphism problem
• Matroid matching and some applications
• Über die Maximalzahl kantendisjunkter A-Wege
• A fast algorithm for finding a maximum free multiflow in an inner Eulerian network and some generalizatons
• A data structure for dynamic trees
• Maximum skew-symmetric flows and matchings
• A new approach to the maximum-flow problem
• On some connectivity properties of Eulerian graphs
• Antisymmetrical Digraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item