engleski

Solving sparse symmetric path problems on a network of computers

We present an optimized version of a previously studied distributed algorithm for solving path problems in graphs. The new version is designed for sparse symmetric path problems, i.e. for graphs that are both sparse and undirected. We report on experiments where the new version has been implemented and evaluated with the PVM package.

graph theory; path problems; distributed computing; parallel virtual machine (PVM); experiments; symmetric path problems; sparse graphs

nije evidentirano