Universität zu Köln

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, Limerick, Ireland, September 12 - 14, 2005 ; revised papers, Springer.

Preview

PDF zaik2005-482.pdf - Submitted Version Download (8MB) | Preview

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.

Item Type:	Book Section, Proceedings Item or annotation in a legal commentary
Creators:	Creators Email ORCID ORCID Put Code Hachul, Stefan UNSPECIFIED UNSPECIFIED UNSPECIFIED Jünger, Michael UNSPECIFIED UNSPECIFIED UNSPECIFIED
URN:	urn:nbn:de:hbz:38-548837
Title of Book:	Graph drawing : 13th international symposium, GD 2005, Limerick, Ireland, September 12 - 14, 2005 ; revised papers
Series Name:	Lecture Notes in Computer Science
Volume:	3843
Date:	2006
Publisher:	Springer
Language:	English
Faculty:	Faculty of Mathematics and Natural Sciences
Divisions:	Faculty of Mathematics and Natural Sciences > Department of Mathematics and Computer Science > Institute of Computer Science
Subjects:	Data processing Computer science
Refereed:	No
URI:	http://kups.ub.uni-koeln.de/id/eprint/54883