Large-Graph Layout Algorithms at Work: An Experimental Study

Authors

  • Stefan Hachul
  • Michael Jünger

DOI:

https://doi.org/10.7155/jgaa.00150

Abstract

In the last decade several algorithms that generate straight-line drawings of general large graphs have been invented. In this paper we investigate some of these methods that are based on force-directed or algebraic approaches in terms of running time and drawing quality on a big variety of artificial and real-world graphs. Our experiments indicate that there exist significant differences in drawing qualities and running times depending on the classes of tested graphs and algorithms.

Downloads

Download data is not yet available.

Downloads

Published

2007-01-01

How to Cite

Hachul, S., & Jünger, M. (2007). Large-Graph Layout Algorithms at Work: An Experimental Study. Journal of Graph Algorithms and Applications, 11(2), 345–369. https://doi.org/10.7155/jgaa.00150