Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Practical parallel algorithms for 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.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Dehne, F. ; Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont., Canada ; Gotz, S.

We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m/n⩾p, where p is the number of processors. For this case, we show that simple algorithms with data-independent communication patterns are efficient both in theory and in practice. The algorithms are evaluated theoretically using Valiant's (1990) BSP model of parallel computation and empirically through implementation results

Published in:

Reliable Distributed Systems, 1998. Proceedings. Seventeenth IEEE Symposium on

Date of Conference:

20-23 Oct 1998