Large-Graph Layout Algorithms at Work: An Experimental Study

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. Article Type Communicated by Submitted Revised Regular paper P. Eades and P. Healy January 2006 January 2007 

• Type: Journal
• Year: 2007
• Where: JGAA
• Authors: Stefan Hachul, Michael Jünger
• Keywords: General Large Graphs, JGAA 2007, Real-world Graphs, Straight-line Drawings