Xinyi Su, Guangyu He, et al.
Dianli Xitong Zidonghua/Automation of Electric Power Systems
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.
Xinyi Su, Guangyu He, et al.
Dianli Xitong Zidonghua/Automation of Electric Power Systems
Oliver Bodemer
IBM J. Res. Dev
Elliot Linzer, M. Vetterli
Computing
Joel L. Wolf, Mark S. Squillante, et al.
IEEE Transactions on Knowledge and Data Engineering