Distributed communication complexity of spanning tree construction

DOI10.1134/S0032946015010068zbMath1331.68083OpenAlexW2074714369MaRDI QIDQ2355664

I. M. Khuziev, Mikhail N. Vyalyi

Publication date: 24 July 2015

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0032946015010068

Mathematics Subject Classification ID

Related Items (1)

Fast protocols for leader election and spanning tree construction in a distributed network

Cites Work

• Symmetry breaking in distributed networks
• A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction
• Bit complexity of breaking and achieving symmetry in chains and rings
• Electing a leader in a synchronous ring

This page was built for publication: Distributed communication complexity of spanning tree construction