Communication-efficient distributed graph clustering and sparsification under duplication models

DOI10.1007/978-3-031-30448-4_27arXiv2302.09652MaRDI QIDQ6057354

Chun Jiang Zhu

Publication date: 4 October 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2302.09652

zbMATH Keywords

graph spannersgraph sparsificationspectral sparsifiersdistributed graph clustering

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• On sparse spanners of weighted graphs
• Graph spanners: a tutorial review
• Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy
• Spectral Sparsification of Graphs
• Additive spanners and (α, β)-spanners
• Approximate distance oracles
• The Communication Complexity of Optimization
• The 4/3 additive spanner exponent is tight
• Tight bounds for distributed functional monitoring
• A general framework for graph sparsification
• Partitioning Well-Clustered Graphs: Spectral Clustering Works!
• New Additive Spanners
• Distributed construction of purely additive spanners
• Graph Sparsification by Effective Resistances
• The communication complexity of multiparty set disjointness under product distributions

This page was built for publication: Communication-efficient distributed graph clustering and sparsification under duplication models