A Fast Multi-Scale Method for Drawing Large Graphs

DOI10.7155/JGAA.00051zbMATH Open1027.68100OpenAlexW2000856020MaRDI QIDQ4405597FDOQ4405597

Authors: David Harel, Yehuda Koren 

Publication date: 23 June 2003

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/50462

Recommendations

• scientific article; zbMATH DE number 2080098
• A multi-scale algorithm for drawing graphs nicely
• A multi-dimensional approach to force-directed layouts of large graphs
• scientific article; zbMATH DE number 2080097
• A Multilevel Algorithm for Force-Directed Graph-Drawing

zbMATH Keywords

multi-scale layout algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cited In (25)

• Complex systems: features, similarity and connectivity
• Faster force-directed graph drawing with the well-separated pair decomposition
• An annotated review on graph drawing and its applications
• Drawing Huge Graphs by Algebraic Multigrid Optimization
• Drawing Big Graphs Using Spectral Sparsification
• Graph reduction with spectral and cut guarantees
• A million edge drawing for a fistful of dollars
• A distributed multilevel force-directed algorithm
• Who's who in global value chains? A weighted network approach
• Visualizing large graphs
• Multi-level graph drawing using infomap clustering
• The Turing Test for Graph Drawing Algorithms
• Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition
• A multi-scale algorithm for drawing graphs nicely
• Fast edge-routing for large graphs
• From simulated annealing to stochastic continuation: a new trend in combinatorial optimization
• A multi-dimensional approach to force-directed layouts of large graphs
• Drawing large graphs by multilevel maxent-stress optimization
• An improved force-directed graph layout algorithm based on aesthetic criteria
• A Multilevel Algorithm for Force-Directed Graph-Drawing
• Title not available (Why is that?)
• Title not available (Why is that?)
• Graph Drawing
• Title not available (Why is that?)
• Efficient Node Overlap Removal Using a Proximity Stress Model

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 Q4405597)