Brief Announcement: The Complexity Landscape of Dynamic Distributed Subgraph Finding
Bonne and Censor-Hillel (ICALP 2019) initiated the study of distributed subgraph finding in dynamic networks of limited bandwidth. For the case where the target subgraph is a clique, they determined the tight bandwidth complexity bounds in nearly all settings. However, several open questions remain, and very little is known about finding subgraphs beyond cliques. In this work, we consider these questions and explore subgraphs beyond cliques.
Authors
- Mingyang Yang (ORCID: https://orcid.org/0009-0006-8971-2064)
- Gopinath Mishra (ORCID: https://orcid.org/0000-0003-0540-0292)
- Yi‐Jun Chang (ORCID: https://orcid.org/0000-0002-0109-2432)
- Yinxiao Chen (ORCID: https://orcid.org/0009-0009-1206-7644)
- Lyuting Chen
Institutions
- National University of Singapore (SG)
Publication Details
- Published
- 2025-06-13
- DOI
- https://doi.org/10.1145/3732772.3733522
- Primary Topic
- Advanced Graph Neural Networks
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Ministry of Education - Singapore