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.
翻译:这是对最近在了解分布式子集发现问题的复杂性方面取得的令人振奋的进展的调查,它概述了各种分布式计算模型中各种子集发现问题的结果和各种变体的发现问题的技术,并说明了一些令人感兴趣的未决问题。 这份版本包含一些关于2021年版本的更新内容,随着取得更多进展,我将努力不断更新。