Hachul, Stefan and Jünger, Michael (2007). Large-Graph Layout Algorithms at Work: An Experimental Study. Journal of Graph Algorithms and Applications, 11 (21). pp. 345-369.

[thumbnail of zaik2006-510.pdf]
Preview
 PDF
zaik2006-510.pdf - Draft 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: Article
Creators:
Creators
Email
ORCID
ORCID Put Code
Hachul, Stefan
UNSPECIFIED
UNSPECIFIED
UNSPECIFIED
Jünger, Michael
UNSPECIFIED
UNSPECIFIED
UNSPECIFIED
URN: urn:nbn:de:hbz:38-548930
Journal or Publication Title: Journal of Graph Algorithms and Applications
Volume: 11
Number: 21
Page Range: pp. 345-369
Date: 2007
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/54893

Downloads

Downloads per month over past year

Export

Actions (login required)

View Item View Item