A decentralized algorithm for spectral analysis
From MaRDI portal
Publication:5901077
DOI10.1145/1007352.1007438zbMath1192.68848MaRDI QIDQ5901077
Publication date: 15 August 2010
Published in: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1007352.1007438
90C35: Programming involving graphs or networks
68Q25: Analysis of algorithms and problem complexity
65F15: Numerical computation of eigenvalues and eigenvectors of matrices
68W15: Distributed algorithms
Related Items
Find Your Place: Simple Distributed Algorithms for Community Detection, Asynchronous privacy-preserving iterative computation on peer-to-peer networks, Graph clustering, Fast distributed algebraic connectivity estimation in large scale networks, Target control and source estimation metrics for dynamical networks, Step-by-step community detection in volume-regular graphs, Spectral complexity of directed graphs and application to structural decomposition, Analysis of randomized protocols for conflict-free distributed access, Unnamed Item