scientific article; zbMATH DE number 7561289

DOI10.4230/LIPIcs.DISC.2018.37zbMath1497.68567MaRDI QIDQ5090930

Ali Mashreghi, Valerie King

Publication date: 21 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

distributed computingminimum spanning treebroadcast tree

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (1)

Communication costs in a geometric communication network

Cites Work

• Construction and Impromptu Repair of an MST in a Distributed Network with o(m) Communication
• An Unconditional Lower Bound on the Time-Approximation Trade-off for the Distributed Minimum Spanning Tree Problem
• A trade-off between information and communication in broadcast protocols
• A Fast Distributed Approximation Algorithm for Minimum Spanning Trees
• Complexity of network synchronization
• A Distributed Algorithm for Minimum-Weight Spanning Trees
• A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees
• Distributed Verification and Hardness of Distributed Approximation
• A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees
• Distributed exact shortest paths in sublinear time
• A Simple Deterministic Distributed MST Algorithm with Near-Optimal Time and Message Complexities
• A highly asynchronous minimum spanning tree protocol
• Efficient threshold detection in a distributed environment
• Time optimal self-stabilizing synchronization
• Optimal distributed algorithm for minimum spanning trees revisited
• Fast distributed construction of k-dominating sets and applications
• On the Complexity of Universal Leader Election
• Dynamic graph connectivity in polylogarithmic worst case time
• Unnamed Item
• Unnamed Item

This page was built for publication: