Problemy Peredachi Informatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Problemy Peredachi Informatsii, 2015, Volume 51, Issue 1, Pages 54–71 (Mi ppi2162)  
This article is cited in 1 scientific paper (total in 1 paper)

Communication Network Theory

Distributed communication complexity of spanning tree construction

M. N. Vyalyiabc, I. M. Khuzieva

a Moscow Institute of Physics and Technology (State University), Moscow, Russia
b Dorodnitsyn Computing Center of the Russian Academy of Sciences, Moscow, Russia
c National Research University-Higher School of Economics, Moscow, Russia
Full-text PDF (252 kB) Citations (1)
References:
PDF
HTML
Abstract: We consider the problem of constructing a spanning tree in a synchronized network with an unknown topology. We give lower and upper bounds on the complexity of protocols for spanning tree constriction in various settings: for deterministic and probabilistic protocols, networks with distinguishable nodes, and anonymous networks. We present suboptimal protocols for which the multiplicative gap from the lower bound can be an arbitrarily slowly growing function of the number of vertices in the network.
Received: 24.07.2014
Revised: 27.10.2014
English version:
Problems of Information Transmission, 2015, Volume 51, Issue 1, Pages 49–65
DOI: https://doi.org/10.1134/S0032946015010068
Bibliographic databases:
Document Type: Article
UDC: 621.391.1+519.1
Language: Russian
Citation: M. N. Vyalyi, I. M. Khuziev, “Distributed communication complexity of spanning tree construction”, Probl. Peredachi Inf., 51:1 (2015), 54–71; Problems Inform. Transmission, 51:1 (2015), 49–65
Citation in format AMSBIB
\Bibitem{VyaKhu15}
\by M.~N.~Vyalyi, I.~M.~Khuziev
\paper Distributed communication complexity of spanning tree construction
\jour Probl. Peredachi Inf.
\yr 2015
\vol 51
\issue 1
\pages 54--71
\mathnet{http://mi.mathnet.ru/ppi2162}
\elib{https://elibrary.ru/item.asp?id=27042335}
\transl
\jour Problems Inform. Transmission
\yr 2015
\vol 51
\issue 1
\pages 49--65
\crossref{https://doi.org/10.1134/S0032946015010068}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000352985900006}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84957953081}
Linking options:
  • https://www.mathnet.ru/eng/ppi2162
  • https://www.mathnet.ru/eng/ppi/v51/i1/p54
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Проблемы передачи информации Problems of Information Transmission
    Statistics & downloads:
    Abstract page:381
    Full-text PDF :66
    References:51
    First page:24
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024