Distributed Subgraph Finding: Progress and Challenges
Keren Censor-Hillel

TL;DR
This survey reviews recent advances, techniques, and open challenges in distributed subgraph finding problems across various models, highlighting progress and ongoing research directions in the field.
Contribution
It provides a comprehensive overview of recent progress, key techniques, and open questions in distributed subgraph finding, updating prior surveys with new developments.
Findings
Summarizes recent progress in distributed subgraph finding
Identifies key techniques used in the field
Highlights open problems and future research directions
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. This version contains some updates over the ICALP 2021 version, and I will try to keep updating it as additional progress is made.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
