The maximum edge-disjoint paths problem in complete graphs
type: Item
instance of: scholarly article
title: The maximum edge-disjoint paths problem in complete graphs
zbMATH Open document ID: 1146.68058
author: Adrian Kosowski
published in: Theoretical Computer Science
publication date: 2008-06-24T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5292244
zbMATH Keywords: graph algorithms
zbMATH Keywords: edge-disjoint paths
zbMATH Keywords: complete graph
MaRDI profile type: Publication
full work available at URL: j.tcs.2008.02.017
OpenAlex ID: W2035149461
cites work: Hardness of the undirected edge-disjoint paths problem
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Q4782743
cites work: On-line edge-coloring with a fixed number of colors
cites work: Q3853641
cites work: Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
cites work: Q4828931
cites work: Integer Programming with a Fixed Number of Variables
cites work: Efficient routing in all-optical networks
cites work: A Theorem on Coloring the Lines of a Network
DOI: 10.1016/J.TCS.2008.02.017
description: scientific article; zbMATH DE number 5292244