A quality metric for visualization of clusters in graphs

DOI10.1007/978-3-030-35802-0_10OpenAlexW2989845771MaRDI QIDQ2206839

Amyra Meidiana, Peter Eades, Daniel Keim, Seok-Hee Hong

Publication date: 26 October 2020

Full work available at URL: https://arxiv.org/abs/1908.07792

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

New Quality Metrics for Dynamic Graph Drawing

Cites Work

• Drawing graphs by eigenvectors: theory and practice
• Multidimensional scaling. I: Theory and method
• Are Crossings Important for Drawing Large Graphs?
• A Sparse Stress Model
• A Method for Comparing Two Hierarchical Clusterings
• Untangling the Hairballs of Multi-Centered, Small-World Online Social Media Networks
• An Experimental Study on Distance-Based Graph Drawing
• 10.1162/153244303321897735
• Graph Drawing
• Graph Drawing
• Shape-Based Quality Metrics for Large Graph Visualization
• Graph Drawing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A quality metric for visualization of clusters in graphs