Multi-level graph drawing using infomap clustering
From MaRDI portal
Publication:2206845
DOI10.1007/978-3-030-35802-0_11OpenAlexW2989713036MaRDI QIDQ2206845
Hassan Chafi, Peter Eades, David Chae, Marnijati Torkel, Ziyang Wang, Seok-Hee Hong, Daniel Langerenken, Sungpack Hong
Publication date: 26 October 2020
Full work available at URL: https://arxiv.org/abs/1908.08151
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Unnamed Item
- An algorithm for drawing general undirected graphs
- Are Crossings Important for Drawing Large Graphs?
- Drawing Large Graphs by Multilevel Maxent-Stress Optimization
- An Experimental Evaluation of Multilevel Layout Methods
- A Fast Multi-Scale Method for Drawing Large Graphs
- GRIP: Graph Drawing with Intelligent Placement
- A Multilevel Algorithm for Force-Directed Graph-Drawing
- Graph Drawing
- Shape-Based Quality Metrics for Large Graph Visualization
- A multi-scale algorithm for drawing graphs nicely
This page was built for publication: Multi-level graph drawing using infomap clustering