Two minimum spanning forest algorithms on fixed-size hypercube computers-Reference-Cited by-同舟云学术

Two minimum spanning forest algorithms on fixed-size hypercube computers

Published:1990-09 Issue:1-3 Volume:15 Page:179-187
ISSN:0167-8191
Container-title:Parallel Computing
language:en
Short-container-title:Parallel Computing

Author:

Das Sajal K,Deo Narsingh,Prasad Sushil

Publisher

Elsevier BV

Subject

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

Reference30 articles.

1. Graph problems on a mesh-connected processor array;Atallah;J. ACM,1984

2. New connectivity and MSF algorithms for shuffle-exchange network and PRAM;Awerbuch;IEEE Trans. Comput.,1987

3. A parallel algorithm for constructing minimum spanning trees;Bentley;J. Algorithms,1980

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

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

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

1. A distributed algorithmic framework for coverage problems in wireless sensor networks;International Journal of Parallel, Emergent and Distributed Systems;2009-08

2. A novel routing scheme on the star and pancake networks and its applications;Parallel Computing;1993-01

3. Parallel algorithms for finding the most vital edge with respect to minimum spanning tree;Parallel Computing;1992-10

4. Stirling networks: a versatile combinatorial topology for multiprocessor systems;Discrete Applied Mathematics;1992-07

5. Parallel minimum spanning forest algorithms on the star and pancake interconnection networks;Parallel Processing: CONPAR 92—VAPP V;1992