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.
Published In: Graph drawing : 13th international symposium, GD 2005, Limerick, Ireland, September 12 - 14, 2005 ; revised papers, Lecture Notes in Computer Science. 3843 Springer 2006.

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


Actions:
Download: [img] PDF - Preprinted Version
Download (7Mb) | Preview
Export as:
Editorial actions: View Item View Item (Login required)
Deposit Information:
ZAIK Number: zaik2005-482
Depositing User: Stefan Hachul
Date Deposited: 02 Feb 2006 00:00
Last Modified: 12 Jan 2012 09:13
URI: http://e-archive.informatik.uni-koeln.de/id/eprint/482