Solving sparse symmetric path problems on a network of computers

被引：0
|
作者：
Manger, R [1 ]
Nogo, G [1 ]
机构：
[1] Univ Zagreb, Dept Math, Zagreb 10000, Croatia
来源：
ITI 2003: PROCEEDINGS OF THE 25TH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY INTERFACES | 2003年
关键词：
graph theory; path problems; distributed computing; parallel virtual machine (PVM); experiments; symmetric path problems; sparse graphs;
D O I：
10.1109/ITI.2003.1225418
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
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.
引用
下载
收藏
页码：657 / 662
页数：6
相关论文
共 50 条
12345