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
عدد الصفحات13
رقم المعيار الدولي للكتب (المطبوع)9783030389185
المعرِّفات الرقمية للأشياء
حالة النشرنُشِر - 2020
الحدث46th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2020 - Limassol, قبرص
المدة: ٢٠ يناير ٢٠٢٠٢٤ يناير ٢٠٢٠

سلسلة المنشورات

الاسمLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
مستوى الصوت12011 LNCS
رقم المعيار الدولي للدوريات (المطبوع)0302-9743
رقم المعيار الدولي للدوريات (الإلكتروني)1611-3349


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

ملاحظة ببليوغرافية

Publisher Copyright:
© 2020, Springer Nature Switzerland AG.


أدرس بدقة موضوعات البحث “Simple Distributed Spanners in Dense Congest Networks'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا