An Experimental Comparison of Fast Algorithms for Drawing General Large Graphs

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 classe s of tested graphs and algorithms