FADE: Graph drawing, clustering, and visual abstraction

DOI10.1007/3-540-44541-2_19MaRDI QIDQ4472308zbMATH OpenFDO

Authors Aaron Quigley, Peter Eades

Publication date 4 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1984/19840197.htm

Mathematics Subject Classification ID

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

Recommendations

• Graph Drawing
• A multilevel algorithm for force-directed graph drawing
• Faster force-directed graph drawing with the well-separated pair decomposition
• A Multilevel Algorithm for Force-Directed Graph-Drawing
• A multi-dimensional approach to force-directed layouts of large graphs

Cited in

(7)

• A multi-dimensional approach to force-directed layouts of large graphs
• Multi-level graph drawing using infomap clustering
• A graph-based N-body approximation with application to stochastic neighbor embedding
• The Binary Stress Model for Graph Drawing
• Visualising reasoning: what ATP can learn from CP
• Generalizing geometric graphs
• Drawing graphs by eigenvectors: theory and practice

This page was built for publication: FADE: Graph drawing, clustering, and visual abstraction

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