License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.OPODIS.2017.4
URN: urn:nbn:de:0030-drops-86252
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/8625/
Go to the corresponding LIPIcs Volume Portal

Korhonen, Janne H. ; Rybicki, Joel

Deterministic Subgraph Detection in Broadcast CONGEST

pdf-format:
LIPIcs-OPODIS-2017-4.pdf (0.6 MB)

Abstract

We present simple deterministic algorithms for subgraph finding and enumeration in the broadcast CONGEST model of distributed computation:
- For any constant k, detecting k-paths and trees on k nodes can be done in O(1) rounds.
- For any constant k, detecting k-cycles and pseudotrees on k nodes can be done in O(n)
rounds.
- On d-degenerate graphs, cliques and 4-cycles can be enumerated in O(d + log n) rounds, and
5-cycles in O(d2 + log n) rounds.
In many cases, these bounds are tight up to logarithmic factors. Moreover, we show that the algorithms for d-degenerate graphs can be improved to O(d/logn) and O(d2/logn), respect- ively, in the supported CONGEST model, which can be seen as an intermediate model between CONGEST and the congested clique.

BibTeX - Entry

@InProceedings{korhonen_et_al:LIPIcs:2018:8625,
  author =	{Janne H. Korhonen and Joel Rybicki},
  title =	{{Deterministic Subgraph Detection in Broadcast CONGEST}},
  booktitle =	{21st International Conference on Principles of Distributed Systems (OPODIS 2017)},
  pages =	{4:1--4:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-061-3},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{95},
  editor =	{James Aspnes and Alysson Bessani and Pascal Felber and Jo{\~a}o Leit{\~a}o},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/8625},
  URN =		{urn:nbn:de:0030-drops-86252},
  doi =		{10.4230/LIPIcs.OPODIS.2017.4},
  annote =	{Keywords: distributed computing, subgraph detection, CONGEST model, lower bounds}
}

Keywords: distributed computing, subgraph detection, CONGEST model, lower bounds
Collection: 21st International Conference on Principles of Distributed Systems (OPODIS 2017)
Issue Date: 2018
Date of publication: 28.03.2018

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