We address the problem of constructing a pair of node-disjoint paths connecting two given nodes in a geometric network. We propose a simple algorithm for constructing such a path that does not use any complicated data structure which can be easily implemented. We also consider two variations of disjoint path pair problems which we call narrow corridor problem and width-bounded corridor problem and present efficient algorithms for solving them.
- Disjoint paths,
- Narrow corridor,
- Path pair
Use Find in Your Library, contact the author, or use interlibrary loan to garner a copy of the article. Publisher copyright policy allows author to archive post-print (author’s final manuscript). When post-print is available or publisher policy changes, the article will be deposited
Laxmi P. Gewali, Henry Selvaraj and Dan Mazzella. "Constrained Disjoint Paths in Geometric Network" International Journal of Computational Intelligence and Applications
Vol. 8 Iss. 2 (2009) p. 141 - 154
Available at: http://works.bepress.com/henry_selvaraj/36/