A fast multi-scale method for drawing large graphs

DOI10.1007/3-540-44541-2_18MaRDI QIDQ4472306zbMATH OpenFDO

Authors David Harel, Yehuda Koren

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/19840183.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

• A Fast Multi-Scale Method for Drawing Large Graphs
• A multi-scale algorithm for drawing graphs nicely
• A multi-dimensional approach to force-directed layouts of large graphs
• A multilevel algorithm for force-directed graph drawing
• Graph Drawing

Cited in

(11)

• A force-directed algorithm for drawing directed graphs symmetrically
• Faster force-directed graph drawing with the well-separated pair decomposition
• A multi-dimensional approach to force-directed layouts of large graphs
• Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition
• Rapid Multipole Graph Drawing on the GPU
• A Fast Multi-Scale Method for Drawing Large Graphs
• Drawing Big Graphs Using Spectral Sparsification
• Graph Drawing
• A multi-scale algorithm for drawing graphs nicely
• Community detection: concepts, algorithms, evaluation and challenges
• Drawing graphs by eigenvectors: theory and practice

This page was built for publication: A fast multi-scale method for drawing large graphs

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