License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2019.132
URN: urn:nbn:de:0030-drops-107082
URL: http://drops.dagstuhl.de/opus/volltexte/2019/10708/
Go to the corresponding LIPIcs Volume Portal


Bonne, Matthias ; Censor-Hillel, Keren

Distributed Detection of Cliques in Dynamic Networks

pdf-format:
LIPIcs-ICALP-2019-132.pdf (0.5 MB)


Abstract

This paper provides an in-depth study of the fundamental problems of finding small subgraphs in distributed dynamic networks. While some problems are trivially easy to handle, such as detecting a triangle that emerges after an edge insertion, we show that, perhaps somewhat surprisingly, other problems exhibit a wide range of complexities in terms of the trade-offs between their round and bandwidth complexities. In the case of triangles, which are only affected by the topology of the immediate neighborhood, some end results are: - The bandwidth complexity of 1-round dynamic triangle detection or listing is Theta(1). - The bandwidth complexity of 1-round dynamic triangle membership listing is Theta(1) for node/edge deletions, Theta(n^{1/2}) for edge insertions, and Theta(n) for node insertions. - The bandwidth complexity of 1-round dynamic triangle membership detection is Theta(1) for node/edge deletions, O(log n) for edge insertions, and Theta(n) for node insertions. Most of our upper and lower bounds are tight. Additionally, we provide almost always tight upper and lower bounds for larger cliques.

BibTeX - Entry

@InProceedings{bonne_et_al:LIPIcs:2019:10708,
  author =	{Matthias Bonne and Keren Censor-Hillel},
  title =	{{Distributed Detection of Cliques in Dynamic Networks}},
  booktitle =	{46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
  pages =	{132:1--132:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-109-2},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{132},
  editor =	{Christel Baier and Ioannis Chatzigiannakis and Paola Flocchini and Stefano Leonardi},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/10708},
  URN =		{urn:nbn:de:0030-drops-107082},
  doi =		{10.4230/LIPIcs.ICALP.2019.132},
  annote =	{Keywords: distributed computing, subgraph detection, dynamic graphs}
}

Keywords: distributed computing, subgraph detection, dynamic graphs
Seminar: 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)
Issue Date: 2019
Date of publication: 08.07.2019


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI