期刊名称:Journal of Computing and Information Technology
印刷版ISSN:1330-1136
电子版ISSN:1846-3908
出版年度:2003
卷号:11
期号:3
页码:179-184
出版社:SRCE - Sveučilišni računski centar
摘要: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.