The disjoint shortest paths problem
type: Item
instance of: scholarly article
title: The disjoint shortest paths problem
zbMATH Open document ID: 0902.68147
DOI: 10.1016/S0166-218X(97)00121-2
published in: Discrete Applied Mathematics
publication date: 1998-10-18T00:00:00Z
full work available at URL: dam
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 1180346
zbMATH Keywords: disjoint shortest paths problem
author: Tali Eilam Tzoreff
MaRDI profile type: Publication
cites work: On the Complexity of Timetable and Multicommodity Flow Problems
cites work: The directed subgraph homeomorphism problem
cites work: On orientations and shortest paths
cites work: The complexity of finding maximum disjoint paths with length constraints
cites work: On the Computational Complexity of Combinatorial Problems
cites work: The complexity of finding two disjoint paths with min-max objective function
cites work: Finding disjoint paths with different path-costs: Complexity and algorithms
cites work: Planar Formulae and Their Uses
cites work: On the complexity of the disjoint paths problem
cites work: Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
cites work: Disjoint Paths—A Survey
cites work: Graph minors. VI. Disjoint paths across a disc
cites work: Graph minors. VII: Disjoint paths on a surface
cites work: Graph minors. IX: Disjoint crossed paths
cites work: Finding k Disjoint Paths in a Directed Planar Graph
cites work: Integer plane multiflows with a mixed number of demands
cites work: Disjoint paths in graphs
cites work: On Odd Cuts and Plane Multicommodity Flows
cites work: A Polynomial Solution to the Undirected Two Paths Problem
description: scientific article; zbMATH DE number 1180346