✦ LIBER ✦

On the complexity of the disjoint paths problem

✍ Scribed by Matthias Middendorf; Frank Pfeiffer

Publisher: Springer-Verlag
Year: 1993
Tongue: English
Weight: 554 KB
Volume: 13
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf01202792

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of the planar directed

On the complexity of the planar directed edge-disjoint paths problem

✍ Dirk Müller 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 278 KB

On the complexity of the planar edge-dis

On the complexity of the planar edge-disjoint paths problem with terminals on the outer boundary

✍ Werner Schwärzler 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 363 KB

On the complexity of vertex-disjoint len

On the complexity of vertex-disjoint length-restricted path problems

✍ Andreas Bley 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 277 KB

On the equivalence in complexity among t

On the equivalence in complexity among three computation problems on maximum number of edge-disjoint s−t paths in a probabilistic graph

✍ Pen Cheng; Shigeru Masuyama 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 396 KB

On the disjoint paths problem

✍ Thành Nguyen 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 163 KB

The time-dependent shortest pair of disj

The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms

✍ Sherali, Hanif D.; Ozbay, Kaan; Subramanian, Shivaram 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 160 KB 👁 3 views

In this paper, we examine complexity issues, models, and algorithms for the problem of finding a shortest pair of disjoint paths between two nodes of a network such that the total travel delay is minimized, given that the individual arc delays are time-dependent. Such disjoint paths address the issu