License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2021.3
URN: urn:nbn:de:0030-drops-140726
URL: https://drops.dagstuhl.de/opus/volltexte/2021/14072/
Go to the corresponding LIPIcs Volume Portal


Censor-Hillel, Keren

Distributed Subgraph Finding: Progress and Challenges (Invited Talk)

pdf-format:
LIPIcs-ICALP-2021-3.pdf (0.7 MB)


Abstract

This is a survey of the exciting recent progress made in understanding the complexity of distributed subgraph finding problems. It overviews the results and techniques for assorted variants of subgraph finding problems in various models of distributed computing, and states intriguing open questions.

BibTeX - Entry

@InProceedings{censorhillel:LIPIcs.ICALP.2021.3,
  author =	{Censor-Hillel, Keren},
  title =	{{Distributed Subgraph Finding: Progress and Challenges}},
  booktitle =	{48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
  pages =	{3:1--3:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-195-5},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{198},
  editor =	{Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2021/14072},
  URN =		{urn:nbn:de:0030-drops-140726},
  doi =		{10.4230/LIPIcs.ICALP.2021.3},
  annote =	{Keywords: distributed algorithms, subgraph finding, limited bandwidth}
}

Keywords: distributed algorithms, subgraph finding, limited bandwidth
Collection: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)
Issue Date: 2021
Date of publication: 02.07.2021


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