Experimental Evaluation of a Parallel Max-Flow Algorithm

The maximum flow problem has been studied for over forty years. One of the methods for solving this problem is the generic push-relabel algorithm. In this paper we develop a parallel version of this sequential algorithm. Our assumed model of computation is a shared-memory multiprocessor. We describe a concrete implementation of the algorithm based on the PVM package, and present the obtained numerical results

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