The maximum edge-disjoint paths problem in complete graphs

DOI10.1016/j.tcs.2008.02.017zbMath1146.68058OpenAlexW2035149461MaRDI QIDQ930909

Adrian Kosowski

Publication date: 24 June 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.02.017

zbMATH Keywords

graph algorithmscomplete graphedge-disjoint paths

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (3)

Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs ⋮ Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax \(k\) vertex-disjoint paths in a directed acyclic graph ⋮ Forwarding and optical indices of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On-line edge-coloring with a fixed number of colors
• Efficient routing in all-optical networks
• Integer Programming with a Fixed Number of Variables
• Hardness of the undirected edge-disjoint paths problem
• A Theorem on Coloring the Lines of a Network
• Graph-Theoretic Concepts in Computer Science
• Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems

This page was built for publication: The maximum edge-disjoint paths problem in complete graphs