engleski

A PVM Program for Solving Path Problems in Sparse Graphs

Path problems are a family of optimization and enumeration problems that reduce to generation or comparison of a paths in directed graphs. In this paper we present a computer program for solving path problems, which is based on the PVM package. Our solution is optimized for sparse graphs, and its speed is further increased by distributed computing. We list the results of experiments,where the program performance has been evaluated on randomly generated path problems.

directed graphs; path problems; sparsity; distributed computing; PVM

nije evidentirano