Searching for "On the complexity of the disjoint paths problems." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

4 documents found, showing 1 through 4.

The Complexity of an Inverse Shortest Paths Problem
by Sandor P. Fekete, Or P. Fekete, Winfried Hochstättler, Winfried Hochstattler, Stephan Kromberg, Stephan Kromberg, Christoph Moll, Christoph Moll, Christoph Moll — 1998 — Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future
… of vertices. The complexity of the "Vertex-Disjoint Paths Problem" (VDPP) is well-studied. An overview can…
Cited by 5 (0 self) – Add To MetaCart

Path Coloring on the Mesh
by Yuval Rabani — 1996 — In Proc. of the 37th Annual IEEE Symposium on Foundations of Computer Science
… is to minimize the number of colors used. A trivial reduction from the disjoint paths problem shows that MPCP…
Cited by 25 (0 self) – Add To MetaCart

An Algorithmic Framework for Protection Switching in WDM Networks
by Kayi Lee, Kai-Yeung (Sunny) Siu
…-t cut and any proper sub-family of F is not. 3. Related Work The complexity of the disjoint path problem…
Cited by 1 (0 self) – Add To MetaCart

On Disjoint Path Pairs with Wavelength Continuity Constraint in WDM Networks
by Reid Andersen, Fan Chung, Arunabha Sen, Guoliang Xue — 2004 — in WDM networks; IEEE Infocom’2004
… expensive in current WDM networks. Also, as shown in the appendix, the disjoint paths problems can be solved…
Cited by 7 (5 self) – Add To MetaCart

Showing 1 through 4.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB