A privacy-protecting coupon system
Liqun Chen, Matthias Enzmann, et al.
FC 2005
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.
Liqun Chen, Matthias Enzmann, et al.
FC 2005
Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics
Khaled A.S. Abdel-Ghaffar
IEEE Trans. Inf. Theory
A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990