A Local Clustering Algorithm for Connection Graphs

DOI10.1007/978-3-319-03536-9_3zbMath1342.05158OpenAlexW3029270137MaRDI QIDQ2938011

Mark Kempton, Fan R. K. 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

weighted graphsCheeger constantPageRank vectors

Mathematics Subject Classification ID

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

Related Items (3)

Magnetic eigenmaps for the visualization of directed networks ⋮ Graph connection Laplacian methods can be made robust to noise ⋮ Embeddings of Riemannian manifolds with finite eigenvector fields of connection Laplacian

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