Multiflows in symmetric digraphs

DOI10.1016/J.DAM.2012.05.008MaRDI QIDQ713317zbMATH OpenOpenAlexFDO

Authors 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

algorithmsmultiflowoptical networksroutingsymmetric digraphs

Mathematics Subject Classification ID

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

Recommendations

• STACS 2004
• The all-or-nothing flow problem in directed graphs with symmetric demand pairs
• The all-or-nothing flow problem in directed graphs with symmetric demand pairs
• Combinatorial approaches to multiflow problems
• Criticality for multicommodity flows

Cites work

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

Cited in

(3)

• STACS 2004
• The all-or-nothing flow problem in directed graphs with symmetric demand pairs
• The all-or-nothing flow problem in directed graphs with symmetric demand pairs

This page was built for publication: Multiflows in symmetric digraphs

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