Energy Models for Graph Clustering

DOI10.7155/JGAA.00154MaRDI QIDQ5301422zbMATH OpenOpenAlexFDO

Authors Andreas Noack

Publication date 19 January 2009

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL http://www.emis.de/journals/JGAA/accepted/2007/Noack2007.11.2.pdf

zbMATH Keywords

cluster structureenergy models

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Graph Drawing
• Graph Drawing
• On Finding Graph Clusterings with Maximum Modularity
• Engineering graph clustering: models and experimental evaluation
• Graph Clustering and Minimum Cut Trees

Cited in

(10)

• Motif-based embedding for graph clustering
• Graph Drawing
• Connected-closeness: A Visual Quantification of Distances in Network Layouts
• An experimental study on the ply number of straight-line drawings
• Importance of numerical implementation and clustering analysis in force-directed algorithms for accurate community detection
• Applying data visualization techniques for stock relationship analysis
• An experimental study on the ply number of straight-line drawings
• Challenger, a new way to visualize data
• A graph-based N-body approximation with application to stochastic neighbor embedding
• Graph Drawing

This page was built for publication: Energy Models for Graph Clustering

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