engleski

Correctness of a distributed algorithm for solving path problems

Path problems are a family of optimization and enumeration problems which reduce to determination of paths in a graph. In this paper we propose a distributed algorithm for solving path problems. The algorithm is designed to run on a ring of processors with private memories. We prove the correctness of the proposed algorithm.

graphs; path problems; parallel algorithms; distributed memory

nije evidentirano