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

A sub-linear time distributed algorithm for minimum-weight 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.
3 Author(s)
Garay, J.A. ; IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA ; Kutten, S. ; Peleg, D.

This paper considers the question of identifying the parameters governing the behavior of fundamental global network problems. Many papers on distributed network algorithms consider the task of optimizing the running time successful when an O(n) bound is achieved on an n-vertex network. We propose that a more sensitive parameter is the network's diameter Diam. This is demonstrated in the paper by providing a distributed minimum-weight spanning tree algorithm whose time complexity is sub-linear in n, but linear in Diam (specifically, O(Diam+n0.614)). Our result is achieved through the application of graph decomposition and edge elimination techniques that may be of independent interest

Published in:

Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on

Date of Conference:

3-5 Nov 1993