Parallel algorithms for finding the most vital edge with respect to minimum spanning tree-Reference-Cited by-同舟云学术

Parallel algorithms for finding the most vital edge with respect to minimum spanning tree

Published:1992-10 Issue:10 Volume:18 Page:1143-1155
ISSN:0167-8191
Container-title:Parallel Computing
language:en
Short-container-title:Parallel Computing

Author:

Hsu Lih-Hsing,Wang Peng-Fei,Wu Chu-Tao

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Graphics and Computer-Aided Design,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Reference18 articles.

1. The Design and Analysis of Parallel Algorithms;Akl,1989

2. Graphy Theory with Applications;Bondy,1976

3. Divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model;Das;IEEE Trans. Circuits and Syst.,1988

4. Forest-based parallel graph algorithms on hypercube computers;Das,1989

5. Parallel graph algorithms for hypercube computers;Das;Parallel Comput.,1990

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs;Mathematical Programming;2004-06-07

2. Sensitivity Analysis for Shortest Path Problems and Maximum Capacity Path Problems in Undirected Graphs;SSRN Electronic Journal;2003

3. Finding the k most vital edges with respect to minimum spanning trees for fixed k;Discrete Applied Mathematics;2001-10

4. Improved parallel algorithms for finding the most vital edge of a graph with respect to minimum spanning tree∗;International Journal of Computer Mathematics;2000-01

5. Increasing the Weight of Minimum Spanning Trees;Journal of Algorithms;1999-11