An experimental comparison of fast algorithms for drawing general large graphs

Abstract

In the last decade several algorithms that generate straightline 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. © Springer-Verlag Berlin Heidelberg 2005.