Distributed detection of clusters of arbitrary size

DOI10.1007/978-3-030-79527-6_21OpenAlexW3175260037MaRDI QIDQ2117744

Bogdan-Adrian Manghiuc

Publication date: 22 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-79527-6_21

zbMATH Keywords

distributed computinggraph clusteringrandomised algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)

Cites Work

• Graph clustering
• Step-by-step community detection in volume-regular graphs
• Community Structures in Classical Network Models
• Testing Cluster Structure of Graphs
• Find Your Place: Simple Distributed Algorithms for Community Detection
• Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration
• Partitioning into Expanders
• Multi-way spectral partitioning and higher-order cheeger inequalities
• Partitioning Well-Clustered Graphs: Spectral Clustering Works!
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Distributed detection of clusters of arbitrary size