Large-Graph Layout Algorithms at Work: An Experimental Study

DOI10.7155/JGAA.00150zbMATH Open1161.68672OpenAlexW2042966559MaRDI QIDQ5301419FDOQ5301419

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

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

Mathematics Subject Classification ID

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

Cited In (16)

• An Experimental Study on the Ply Number of Straight-line Drawings
• Faster force-directed graph drawing with the well-separated pair decomposition
• An experimental evaluation of multilevel layout methods
• Title not available (Why is that?)
• Connected-closeness: A Visual Quantification of Distances in Network Layouts
• Title not available (Why is that?)
• Graph Drawing
• A Distributed Multilevel Force-Directed Algorithm
• PLANET: a radial layout algorithm for network visualization
• An Experimental Study on the Ply Number of Straight-Line Drawings
• Fast layout computation of clustered networks: algorithmic advances and experimental analysis
• Title not available (Why is that?)
• Drawing directed acyclic graphs: an experimental study
• An experimental comparison of four graph drawing algorithms.
• Graph Drawing
• Hybrid layout algorithm based on skeleton subgraph

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)