## Abstract

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 language | English |
---|---|

Pages (from-to) | 251-253 |

Number of pages | 3 |

Journal | Information Processing Letters |

Volume | 24 |

Issue number | 4 |

DOIs | |

State | Published - 2 Mar 1987 |

Externally published | Yes |

## Keywords

- Message routing
- communication network
- dynamic routing
- graph theory

## ASJC Scopus subject areas

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