Large-Graph Layout Algorithms at Work: An Experimental Study
Stefan Hachul and Michael J√ľnger
Vol. 11, no. 2, pp. 345-369, 2007. Regular paper.
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.
Submitted: January 2006.
Revised: January 2007.
Communicated by Peter Eades and Patrick Healy
article (PDF)