Simple Distributed Spanners in Dense Congest Networks

Leonid Barenboim, Tzalik Maimon

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


The problem of computing a sparse spanning subgraph is a well-studied problem in the distributed setting, and a lot of research was done in the direction of computing spanners or solving the more relaxed problem of connectivity. Still, efficiently constructing a linear-size spanner deterministically remains a challenging open problem even in specific topologies. In this paper we provide several simple spanner constructions of linear size, for various graph families. Our first result shows that the connectivity problem can be solved deterministically using a linear size spanner within constant running time on graphs with bounded neighborhood independence. This is a very wide family of graphs that includes unit-disk graphs, unit-ball graphs, line graphs, claw-free graphs and many others. Moreover, our algorithm works in the model. It also immediately leads to a constant time deterministic solution for the connectivity problem in the Congested-Clique. Our second result provides a linear size spanner in the model for graphs with bounded diversity. This is a subtype of graphs with bounded neighborhood independence that captures various types of networks, such as wireless networks and social networks. Here too our result has constant running time and is deterministic. Moreover, the latter result has an additional desired property of a small stretch.

Original languageEnglish
Title of host publicationSOFSEM 2020
Subtitle of host publicationTheory and Practice of Computer Science - 46th International Conference on Current Trends in Theory and Practice of Informatics, SOFSEM 2020, Proceedings
EditorsAlexander Chatzigeorgiou, Riccardo Dondi, Herodotos Herodotou, Christos Kapoutsis, Yannis Manolopoulos, George A. Papadopoulos, Florian Sikora
Number of pages13
ISBN (Print)9783030389185
StatePublished - 2020
Event46th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2020 - Limassol, Cyprus
Duration: 20 Jan 202024 Jan 2020

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12011 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference46th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2020

Bibliographical note

Publisher Copyright:
© 2020, Springer Nature Switzerland AG.


  • Distributed computing
  • Diversity
  • Spanners


Dive into the research topics of 'Simple Distributed Spanners in Dense Congest Networks'. Together they form a unique fingerprint.

Cite this