Victor Valls, Panagiotis Promponas, et al.
IEEE Communications Magazine
In this article we consider the problem of finding a simple path between two nodes of a network using a limited local search. A simple path is one which contains no cycles. The network is assumed to reside in the Euclidean plane, although it may not necessarily be planar in the usual graph-theoretic sense. The algorithm that we shall present features two parameters which limit the search for a simple path. These parameters may be adjusted to increase the probability that a simple path will be found (at the expense of higher computation costs). One application of this algorithm is in finding alternative routes in a partially damaged communications network. © 1987.
Victor Valls, Panagiotis Promponas, et al.
IEEE Communications Magazine
Anupam Gupta, Viswanath Nagarajan, et al.
Operations Research
Apostol Natsev, Alexander Haubold, et al.
MMSP 2007
Matthias Kaiserswerth
IEEE/ACM Transactions on Networking