The maximum edge-disjoint paths problem in complete graphs
From MaRDI portal
Publication:930909
DOI10.1016/j.tcs.2008.02.017zbMath1146.68058MaRDI QIDQ930909
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
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms
Related Items
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item