2026-07-21T19:27:48Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:14072 2024-03-06T10:53:24Z ddc:004 open_access

Distributed Subgraph Finding: Progress and Challenges (Invited Talk) Censor-Hillel, Keren distributed algorithms subgraph finding limited bandwidth 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Keren Censor-Hillel 2021 Is Part Of LIPIcs, Volume 198, 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ICALP.2021.3 urn:nbn:de:0030-drops-140726 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.3 eng https://creativecommons.org/licenses/by/4.0/legalcode