Large-Graph Layout Algorithms at Work: An Experimental Study

DOI10.7155/JGAA.00150MaRDI QIDQ5301419zbMATHOpenAlexFDO

Authors Stefan Hachul, Michael Jünger

Publication date 19 January 2009

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

Full work available at URL http://www.emis.de/journals/JGAA/accepted/2007/HachulJuenger2007.11.2.pdf

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• Graph Drawing
• Graph Drawing
• An experimental comparison of four graph drawing algorithms.
• A multi-dimensional approach to force-directed layouts of large graphs
• scientific article; zbMATH DE number 2080100

Cited in

(19)

• An experimental evaluation of multilevel layout methods
• Graph Drawing
• Graph Drawing
• A distributed multilevel force-directed algorithm
• scientific article; zbMATH DE number 1858605 (Why is no real title available?)
• Fast layout computation of clustered networks: algorithmic advances and experimental analysis
• scientific article; zbMATH DE number 7286697 (Why is no real title available?)
• An experimental study on the ply number of straight-line drawings
• scientific article; zbMATH DE number 1670640 (Why is no real title available?)
• An experimental comparison of four graph drawing algorithms.
• Shape-based quality metrics for large graph visualization
• An experimental study on the ply number of straight-line drawings
• Drawing directed acyclic graphs: an experimental study
• Hybrid layout algorithm based on skeleton subgraph
• Faster force-directed graph drawing with the well-separated pair decomposition
• GraphMaps: browsing large graphs as interactive maps
• Reinforcing the spring algorithms: the Taguchi approach
• PLANET: a radial layout algorithm for network visualization
• Connected-closeness: A Visual Quantification of Distances in Network Layouts

This page was built for publication: Large-Graph Layout Algorithms at Work: An Experimental Study

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