Experimental and Efficient Algorithms

DOI10.1007/B136461MaRDI QIDQ5710052zbMATH OpenOpenAlexFDO

Authors Pekka Orponen, Satu Elisa Schaeffer

Publication date 30 November 2005

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

Full work available at URL https://doi.org/10.1007/b136461

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Social networks; opinion dynamics (91D30)

Recommendations

• A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning
• Spectral clustering revisited: information hidden in the Fiedler vector
• Variational perspective on local graph clustering
• scientific article; zbMATH DE number 6276186
• Hearing the clusters of a graph: A distributed algorithm

Cited in

(9)

• Variational perspective on local graph clustering
• Locally supported eigenvectors of matrices associated with connected and unweighted power-law graphs
• A Local Clustering Algorithm for Connection Graphs
• scientific article; zbMATH DE number 5556003 (Why is no real title available?)
• Mixing local and global information for community detection in large networks
• Hearing the clusters of a graph: A distributed algorithm
• Graph clustering
• Robust Clustering Oracle and Local Reconstructor of Cluster Structure of Graphs
• A decentralized algorithm for spectral analysis

This page was built for publication: Experimental and Efficient Algorithms

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