Izvorni znanstveni članak
https://doi.org/10.2498/cit.2003.03.05
Solving Sparse Symmetric Path Problems on a Network of Computers
Goranka Nogo
Robert Manger
Sažetak
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.
Ključne riječi
Hrčak ID:
44744
URI
Datum izdavanja:
30.9.2003.
Posjeta: 1.283 *