DMCA
An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms (1996)
| Citations: | 54 - 1 self |
BibTeX
@INPROCEEDINGS{Brandenburg96anexperimental,
author = {Franz J. Brandenburg and Michael Himsolt and Christoph Rohrer},
title = {An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms},
booktitle = {},
year = {1996},
pages = {76--87},
publisher = {Springer-Verlag}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
. We report on our experiments with five graph drawing algorithms for general undirected graphs. These are the algorithms FR introduced by Fruchterman and Reingold [5], KK by Kamada and Kawai [11], DH by Davidson and Harel [1], Tu by Tunkelang [13] and GEM by Frick, Ludwig and Mehldau [6]. Implementations of these algorithms have been integrated into our GraphEd system [9]. We have tested these algorithms on a wide collection of examples and with different settings of parameters. Our examples are from original papers and by our own. The obtained drawings are evaluated both empirically and by GraphEd's evaluation toolkit. As a conclusion we can confirm the reported good behaviour of the algorithms. Combining time and quality we recommend to use GEM or KK first, then FR and Tu and finally DH. 1 Introduction Graph drawing has become an important area of research in Computer Science. There is a wide range of applications including data structures, data bases, software engineering, VLSI te...
Keyphrases
experimental comparison randomized graph drawing algorithm data structure graphed system software engineering wide collection different setting vlsi te introduction graph drawing obtained drawing evaluation toolkit original paper data base good behaviour general undirected graph important area algorithm fr wide range computer science
