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 条
  • [21] Output-threshold coupled neural network for solving the shortest path problems
    ZHANG Junying
    Computer Department
    Institute of Computer Science
    Department of Electrical and Computer Engineering
    Science China(Information Sciences), 2004, (01) : 20 - 33
  • [22] Output-threshold coupled neural network for solving the shortest path problems
    Junying Zhang
    Defeng Wang
    Meihong Shi
    Joseph Yue Wang
    Science in China Series F: Information Sciences, 2004, 47 : 20 - 33
  • [23] Output-threshold coupled neural network for solving the shortest path problems
    Zhang, JY
    Wang, DF
    Shi, MH
    Wang, JY
    SCIENCE IN CHINA SERIES F-INFORMATION SCIENCES, 2004, 47 (01): : 20 - 33
  • [24] Strategy for solving static multiple-optimal path transit network problems
    Koncz, N
    Greenfeld, J
    Mouskos, K
    JOURNAL OF TRANSPORTATION ENGINEERING-ASCE, 1996, 122 (03): : 218 - 225
  • [25] Composite path algebras for solving path problems in graphs
    Manger, R
    ARS COMBINATORIA, 2006, 78 : 137 - 150
  • [26] Fundamentals of the Complex Informational Structure of Programs for Solving Network Problems with Third Generation Computers.
    Kimel'man, L.B.
    Losev, S.B.
    Rossovskii, E.L.
    Elektrichestvo, 1974, (05): : 13 - 21
  • [27] Novel symmetric numerical methods for solving symmetric mathematical problems
    Ibrahimov V.R.
    Mehdiyeva G.Y.U.
    Yue X.-G.
    Kaabar M.K.A.
    Noeiaghdam S.
    Juraev D.A.
    International Journal of Circuits, Systems and Signal Processing, 2021, 15 : 1545 - 1557
  • [28] FAST ALGORITHMS FOR SOLVING PATH PROBLEMS
    TARJAN, RE
    JOURNAL OF THE ACM, 1981, 28 (03) : 594 - 614
  • [29] On solving dynamic shortest path problems
    Nasrabadi, Ebrahim
    Hashemi, S. Mehdi
    20TH INTERNATIONAL CONFERENCE, EURO MINI CONFERENCE CONTINUOUS OPTIMIZATION AND KNOWLEDGE-BASED TECHNOLOGIES, EUROPT'2008, 2008, : 48 - 53
  • [30] A library of subroutines for solving path problems
    Manger, R
    KOI'96 - 6TH INTERNATIONAL CONFERENCE ON OPERATIONAL RESEARCH, PROCEEDINGS, 1996, : 49 - 56
12345