A faster distributed protocol for constructing a minimum spanning tree
type: Item
instance of: scholarly article
title: A faster distributed protocol for constructing a minimum spanning tree
zbMATH Open document ID: 1118.68026
author: Michael Elkin
published in: Journal of Computer and System Sciences
publication date: 2006-12-07T00:00:00Z
Mathematics Subject Classification ID: 68M12
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5078606
zbMATH Keywords: minimum spanning tree
zbMATH Keywords: distributed computing
MaRDI profile type: Publication
full work available at URL: j.jcss.2006.07.002
OpenAlex ID: W2030982625
cites work: Complexity of network synchronization
cites work: Fast distributed network decompositions and covers
cites work: Routing with Polynomial Communication-Space Trade-Off
cites work: Q4004078
cites work: Knowledge and common knowledge in a Byzantine environment: Crash failures
cites work: Computing almost shortest paths (extended abstract)
cites work: Optimal aggregation algorithms for middleware.
cites work: A Distributed Algorithm for Minimum-Weight Spanning Trees
cites work: Fast Distributed Construction of Smallk-Dominating Sets and Applications
cites work: Q4071737
cites work: Locality in Distributed Graph Algorithms
cites work: Q3138968
cites work: Distributed Computing: A Locality-Sensitive Approach
DOI: 10.1016/J.JCSS.2006.07.002
description: scientific article; zbMATH DE number 5078606