DocumentCode
1955848
Title
Solving sparse symmetric path problems on a network of computers
Author
Manger, R. ; Nogo, Goranka
Author_Institution
Dept. of Math., Zagreb Univ., Croatia
fYear
2003
fDate
16-19 June 2003
Firstpage
657
Lastpage
662
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
computer networks; distributed algorithms; graph theory; sparse matrices; virtual machines; PVM; computer network; distributed algorithm computing; graph theory; parallel virtual machine; sparse graph; sparse symmetric path problem; undirected graph; Algebra; Computer interfaces; Computer networks; Ear; Information technology; Packaging; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Technology Interfaces, 2003. ITI 2003. Proceedings of the 25th International Conference on
ISSN
1330-1012
Print_ISBN
953-96769-6-7
Type
conf
DOI
10.1109/ITI.2003.1225418
Filename
1225418
Link To Document