| Article ID: | iaor2009625 |
| Country: | Germany |
| Volume: | 8 |
| Issue: | 2 |
| Start Page Number: | 109 |
| End Page Number: | 123 |
| Publication Date: | Jun 2000 |
| Journal: | Central European Journal of Operations Research |
| Authors: | Manger Robert, Nogo Goranka |
| Keywords: | computational analysis: parallel computers, graphs |
Path problems are a family of optimization and enumeration problems that reduce to generation or comparison of paths in graphs. In this paper we present three optimized versions of a distributed algorithm for solving path problems. The new versions are faster than the original algorithm, but they are applicable only to certain instances of problems, i.e. to undirected, acyclic, and sparse graphs, respectively.