Large-Graph Layout Algorithms at Work: An Experimental Study

Stefan Hachul, Michael Jünger
2007 Journal of Graph Algorithms and Applications  
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.
doi:10.7155/jgaa.00150 fatcat:dljebf65cjdmbawvyzusvpgvga