Finding and Visualizing Graph Clusters Using PageRank Optimization

DOI10.1080/15427951.2012.625254zbMATH Open1245.68146OpenAlexW1969690581MaRDI QIDQ5891735

Alexander Tsiatas, Fan R. K. Chung

Publication date: 29 August 2012

Published in: Internet Mathematics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.im/1339678183

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Internet topics (68M11)

Related Items (1)

Clustering, Visualizing, and Navigating for Large Dynamic Graphs

Recommendations

• Graph clustering 👍 👎
• Personalized PageRank clustering: a graph clustering algorithm based on random walks 👍 👎
• A quality metric for visualization of clusters in graphs 👍 👎
• Graph Clustering Via Intra-Cluster Density Maximization 👍 👎
• Clustering, Visualizing, and Navigating for Large Dynamic Graphs 👍 👎
• Finding and Visualizing Graph Clusters Using PageRank Optimization 👍 👎

This page was built for publication: Finding and Visualizing Graph Clusters Using PageRank Optimization

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