Multiflows in symmetric digraphs

DOI10.1016/j.dam.2012.05.008zbMath1252.05079OpenAlexW1975158954MaRDI QIDQ713317

Aubin Jarry

Publication date: 26 October 2012

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

Full work available at URL: https://doi.org/10.1016/j.dam.2012.05.008

zbMATH Keywords

algorithmsoptical networksroutingsymmetric digraphsmultiflow

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Flows in graphs (05C21)

Cites Work

• Unnamed Item
• Unnamed Item
• Half-integral five-terminus flows
• Disjoint paths in symmetric digraphs
• Combinatorial approaches to multiflow problems
• The directed subgraph homeomorphism problem
• The subgraph homeomorphism problem
• Graph minors. XIII: The disjoint paths problem
• NP-completeness of some edge-disjoint paths problems
• On the complexity of the planar edge-disjoint paths problem with terminals on the outer boundary
• On the complexity of the disjoint paths problem
• Multiflow Feasibility: An Annotated Tableau
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• On the Computational Complexity of Combinatorial Problems
• On the Complexity of Timetable and Multicommodity Flow Problems
• Graph Classes: A Survey
• All-to-all communication for some wavelength-routed all-optical networks
• Feasibility of Two Commodity Network Flows
• Multi-Commodity Network Flows
• The complexity of path coloring and call scheduling
• The edge-disjoint paths problem is NP-complete for series-parallel graphs

This page was built for publication: Multiflows in symmetric digraphs