By Topic

A parallel algorithm for k-minimum spanning trees

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Jun Ma ; Dept. of Comput. Sci., Shandong Univ., Jinan, China ; K. Iwama ; Qian-Ping Gu

A parallel algorithm to find k, 2⩽k⩽nn-2, spanning trees from a connected, weighted and undirected graph C(V, E, W) in the order of increasing weight is presented. It runs in O(T(n)+klogn) time with O(n2/log n) processors on a CREW PRAM, where n=|V|, m=|E| and T(n), O(log n)⩽T(n)⩽O(log2 n), is the time of the fastest parallel algorithms to find a minimum spanning tree of G on a CREW PRAM with no more than O(n2 /log n) processors. Since T(n)=O(log2 n) for the time being, this result shows that to find k minimum spanning trees can be done in the same time bound as to find just one when k⩽O(log n) on a CREW PRAM

Published in:

Parallel Algorithms/Architecture Synthesis, 1997. Proceedings., Second Aizu International Symposium

Date of Conference:

17-21 Mar 1997