An Experimental Comparison of Fast Algorithms for Drawing General Large Graphs

Hachul, Stefan and Jünger, Michael (2006) An Experimental Comparison of Fast Algorithms for Drawing General Large Graphs. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005 , pp. 235-250(Official URL: http://dx.doi.org/10.1007/11618058_22).

Full text not available from this repository.

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

Item Type: Conference Paper
Additional Information: 10.1007/11618058_22
Classifications: M Methods > M.400 Force-directed / Energy-based
M Methods > M.001 General
URI: http://gdea.informatik.uni-koeln.de/id/eprint/694

Actions (login required)

View Item View Item