Disjoint paths in symmetric digraphs

DOI10.1016/j.dam.2008.04.024zbMath1229.05171OpenAlexW1968740157MaRDI QIDQ1003758

Stéphane Pérennes, Aubin Jarry

Publication date: 4 March 2009

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

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

zbMATH Keywords

disjoint pathssymmetric digraphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Multiflows in symmetric digraphs

Cites Work

• Unnamed Item
• Multicommodity flows in certain planar directed networks
• The directed subgraph homeomorphism problem
• Graph minors. XIII: The disjoint paths problem
• NP-completeness of some edge-disjoint paths problems
• On the complexity of the disjoint paths problem
• A Polynomial Solution to the Undirected Two Paths Problem
• 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
• Graph Classes: A Survey
• The subgraph homeomorphism problem
• Weak Three-Linking in Eulerian Dgraphs
• The edge-disjoint paths problem is NP-complete for series-parallel graphs

This page was built for publication: Disjoint paths in symmetric digraphs