Work

Distributed protocols for spanning tree construction and leader election

Year: 2015

Type: preprint

Abstract: We present fast deterministic distributed protocols in synchronous networks for leader election and spanning tree construction. The protocols are designed under the assumption that nodes in a network have identifiers but the size of an identifier is unlimited. So time bounds of protocols depend on the sizes of identifiers. We present fast protocols running in time $O(D\log L+L)$, where $L$ is the size of the minimal identifier and $D$ is the diameter of a network.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1512.01795

Authors: Khuziev, I. M., Vyalyi, M. N.

Institutions: Moscow Institute of Physics and Technology, National Research University Higher School of Economics, Dorodnitsyn Computing Centre

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: Russian Foundation for Basic Research

Award: G4711892333

OpenAlex ID: W2259066976

Cites: 6

Cited by:

Related to: 10