Distributed detection of clusters of arbitrary size

DOI10.1007/978-3-030-79527-6_21MaRDI QIDQ2117744zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Distributed detection of cliques in dynamic networks
• Optimal Distributed Detection in Clustered Wireless Sensor Networks
• Distributed Detection of APTs: Consensus vs. Clustering
• Distributed Detection With Empirically Observed Statistics
• Detecting the number of clusters in a network
• The complexity of detecting fixed-density clusters
• scientific article; zbMATH DE number 2011857
• Distributed detection and fusion in a large wireless sensor network of random size
• Cluster detection in networks using percolation

Cites work

• Average whenever you meet: opportunistic protocols for community detection
• Community structures in classical network models
• Find Your Place: Simple Distributed Algorithms for Community Detection
• Graph clustering
• scientific article; zbMATH DE number 5454133 (Why is no real title available?)
• Improved distributed expander decomposition and nearly optimal triangle enumeration
• Partitioning into expanders
• Partitioning well-clustered graphs: spectral clustering works!
• Random walks on dynamic graphs: mixing times, hitting times, and return probabilities
• Step-by-step community detection in volume-regular graphs
• Testing cluster structure of graphs

Cited in

(1)

• Optimal Distributed Detection in Clustered Wireless Sensor Networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117744)