Skip to the main content

Original scientific paper

https://doi.org/10.2498/cit.2003.03.05

Solving Sparse Symmetric Path Problems on a Network of Computers

Goranka Nogo
Robert Manger


Full text: english pdf 139 Kb

page 179-184

downloads: 545

cite


Abstract

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.

Keywords

Hrčak ID:

44744

URI

https://hrcak.srce.hr/44744

Publication date:

30.9.2003.

Visits: 952 *