Distributed Subgraph Finding: Progress and Challenges (Invited Talk)
Keren Censor-Hillel · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2021
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.