Simple Distributed Spanners in Dense Congest Networks

Leonid Barenboim, Tzalik Maimon

פרסום מחקרי: פרק בספר / בדוח / בכנספרסום בספר כנסביקורת עמיתים

תקציר

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.

שפה מקוריתאנגלית
כותר פרסום המארחSOFSEM 2020
כותר משנה של פרסום המארחTheory and Practice of Computer Science - 46th International Conference on Current Trends in Theory and Practice of Informatics, SOFSEM 2020, Proceedings
עורכיםAlexander Chatzigeorgiou, Riccardo Dondi, Herodotos Herodotou, Christos Kapoutsis, Yannis Manolopoulos, George A. Papadopoulos, Florian Sikora
מוציא לאורSpringer
עמודים260-272
מספר עמודים13
מסת"ב (מודפס)9783030389185
מזהי עצם דיגיטלי (DOIs)
סטטוס פרסוםפורסם - 2020
אירוע46th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2020 - Limassol, קפריסין
משך הזמן: 20 ינו׳ 202024 ינו׳ 2020

סדרות פרסומים

שםLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
כרך12011 LNCS
ISSN (מודפס)0302-9743
ISSN (אלקטרוני)1611-3349

כנס

כנס46th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2020
מדינה/אזורקפריסין
עירLimassol
תקופה20/01/2024/01/20

הערה ביבליוגרפית

Publisher Copyright:
© 2020, Springer Nature Switzerland AG.

טביעת אצבע

להלן מוצגים תחומי המחקר של הפרסום 'Simple Distributed Spanners in Dense Congest Networks'. יחד הם יוצרים טביעת אצבע ייחודית.

פורמט ציטוט ביבליוגרפי