Skip to Main content Skip to Navigation
Conference papers

Local MST computation with short advice

Abstract : We use the recently introduced advising scheme framework for measuring the difficulty of locally distributively computing a Minimum Spanning Tree (MST). An (m, t)-advising scheme for a distributed problem P is a way, for every possible input I of P , to provide an ”advice” (i.e., a bit string) about I to each node so that: (1) the maximum size of the advices is at most m bits, and (2) the problem P can be solved distributively in at most t rounds using the advices as inputs. In case of MST, the output returned by each node of a weighted graph G is the edge leading to its parent in some rooted MST T of G. Clearly, there is a trivial (log n
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download
Contributor : Emmanuelle Lebhar <>
Submitted on : Friday, June 15, 2007 - 4:39:00 PM
Last modification on : Saturday, March 28, 2020 - 2:13:03 AM
Long-term archiving on: : Friday, September 21, 2012 - 4:30:55 PM


Files produced by the author(s)


  • HAL Id : hal-00154849, version 1



Pierre Fraigniaud, Amos Korman, Emmanuelle Lebhar. Local MST computation with short advice. ACM Symposium on Parallel Algorithms and Architectures, Jun 2007, San Diego, United States. pp.154. ⟨hal-00154849⟩



Record views


Files downloads