A general method for avoiding cycling in a network

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)251-253
Number of pages3
JournalInformation Processing Letters
Issue number4
StatePublished - 2 Mar 1987
Externally publishedYes


  • Message routing
  • communication network
  • dynamic routing
  • graph theory

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications


Dive into the research topics of 'A general method for avoiding cycling in a network'. Together they form a unique fingerprint.

Cite this