Content area

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.

Details

1009240
Title
Distributed Subgraph Finding: Progress and Challenges
Publication title
arXiv.org; Ithaca
Publication year
2024
Publication date
Dec 22, 2024
Section
Computer Science
Publisher
Cornell University Library, arXiv.org
Source
arXiv.org
Place of publication
Ithaca
Country of publication
United States
University/institution
Cornell University Library arXiv.org
e-ISSN
2331-8422
Source type
Working Paper
Language of publication
English
Document type
Working Paper
Publication history
 
 
Online publication date
2024-12-24
Milestone dates
2022-03-13 (Submission v1); 2022-11-06 (Submission v2); 2022-12-04 (Submission v3); 2024-12-22 (Submission v4)
Publication history
 
 
   First posting date
24 Dec 2024
ProQuest document ID
2639113898
Document URL
https://www.proquest.com/working-papers/distributed-subgraph-finding-progress-challenges/docview/2639113898/se-2?accountid=208611
Full text outside of ProQuest
Copyright
© 2024. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Last updated
2024-12-25
Database
ProQuest One Academic