Distributed detection of clusters of arbitrary size

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

Bogdan-Adrian Manghiuc

Publication date: 22 March 2022

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

Recommendations

• scientific article; zbMATH DE number 7561625
• 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

zbMATH Keywords

graph clusteringdistributed computingrandomised 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
• Title not available (Why is that?)
• Partitioning into Expanders
• Multi-way spectral partitioning and higher-order cheeger inequalities
• Community structures in classical network models
• Testing Cluster Structure of Graphs
• Title not available (Why is that?)
• Partitioning Well-Clustered Graphs: Spectral Clustering Works!
• Step-by-step community detection in volume-regular graphs
• Title not available (Why is that?)
• Find Your Place: Simple Distributed Algorithms for Community Detection
• Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration

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)