A Local Clustering Algorithm for Connection Graphs

DOI10.1007/978-3-319-03536-9_3MaRDI QIDQ2938011zbMATH OpenOpenAlexFDO

Authors Mark Kempton, Fan Chung

Publication date 13 January 2015

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

Full work available at URL https://doi.org/10.1007/978-3-319-03536-9_3

zbMATH Keywords

Cheeger constantweighted graphsPageRank vectors

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Signed and weighted graphs (05C22) Connectivity (05C40) Internet topics (68M11)

Recommendations

• A local clustering algorithm for connection graphs
• scientific article; zbMATH DE number 5556003
• Flow-based algorithms for local graph clustering
• Experimental and Efficient Algorithms
• A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning
• An automatic clustering algorithm for complex networks based on local agglomeration
• New Clusterization Method Based on Graph Connectivity Search
• New classes of clustering coefficient locally maximizing graphs
• Clustering to Given Connectivities
• Clustering algorithm of graphs

Cited in

(11)

• Clustering algorithm of graphs
• Connection Laplacian on discrete tori with converging property
• A local clustering algorithm for connection graphs
• Topological graph clustering with thin position
• Ranking and sparsifying a connection graph
• Robust Clustering Oracle and Local Reconstructor of Cluster Structure of Graphs
• Graph connection Laplacian methods can be made robust to noise
• Embeddings of Riemannian manifolds with finite eigenvector fields of connection Laplacian
• scientific article; zbMATH DE number 5556003 (Why is no real title available?)
• Ranking and sparsifying a connection graph
• Magnetic eigenmaps for the visualization of directed networks

This page was built for publication: A Local Clustering Algorithm for Connection Graphs

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