A highly asynchronous minimum spanning tree protocol

DOI10.1007/BF02242717zbMath1448.68475OpenAlexW1991541026MaRDI QIDQ5136990

Gurdip Singh, Arthur Bernstein

Publication date: 30 November 2020

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02242717

zbMATH Keywords

graph theorysynchronizationtime complexityminimum spanning treedistributed algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Related Items (5)

Latency, capacity, and distributed minimum spanning trees ⋮ Optimal cost-sensitive distributed minimum spanning tree algorithm ⋮ Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: A highly asynchronous minimum spanning tree protocol