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.

翻译：本文综述了在理解分布式子图查找问题复杂性方面近期取得的激动人心进展。文章概述了在不同分布式计算模型中各类子图查找变体的研究成果与技术方法，并提出了若干引人深思的开放性问题。本版本相较于ICALP 2021版本包含若干更新，作者将持续跟进最新进展并适时更新内容。