论文标题

分布式子图发现:进度和挑战

Distributed Subgraph Finding: Progress and Challenges

论文作者

Censor-Hillel, Keren

论文摘要

这是对了解分布式子图发现问题复杂性的最新进展的调查。它概述了各种分布式计算模型中的子图形问题的各种变体的结果和技术,并指出了有趣的开放问题。此版本包含有关ICALP 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. This version contains some updates over the ICALP 2021 version, and I will try to keep updating it as additional progress is made.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源