Multi-level graph drawing using infomap clustering

DOI10.1007/978-3-030-35802-0_11MaRDI QIDQ2206845zbMATH OpenOpenAlexFDO

Authors Seok-Hee Hong, Peter Eades, Marnijati Torkel, Ziyang Wang, David Chae, Sungpack Hong, Daniel Langerenken, Hassan Chafi

Publication date 26 October 2020

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

Mathematics Subject Classification ID

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

Recommendations

• Multilevel drawings of clustered graphs
• Multilayer drawings of clustered graphs
• Large graph visualization from a hierarchical node clustering
• Information visualization on the base of hierarchical graphs
• MapSets: visualizing embedded and clustered graphs
• MapSets: visualizing embedded and clustered graphs
• Drawing clustered graphs as topographic maps
• Drawing clusters and hierarchies

Cites work

• A Fast Multi-Scale Method for Drawing Large Graphs
• A multi-scale algorithm for drawing graphs nicely
• A Multilevel Algorithm for Force-Directed Graph-Drawing
• An algorithm for drawing general undirected graphs
• An experimental evaluation of multilevel layout methods
• Are crossings important for drawing large graphs?
• Drawing large graphs by multilevel maxent-stress optimization
• Drawing large graphs with a potential-field-based multilevel algorithm
• FADE: Graph drawing, clustering, and visual abstraction
• GRIP: Graph Drawing with Intelligent Placement
• Shape-based quality metrics for large graph visualization

Cited in

(4)

• A quality metric for visualization of clusters in graphs
• The perception of stress in graph drawings
• Stress in graph drawings: perception, preference, and performance
• Using the metro-map metaphor for drawing hypergraphs

This page was built for publication: Multi-level graph drawing using infomap clustering

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