Premium
Experimental studies on graph drawing algorithms
Author(s) -
Vismara Luca,
Di Battista Giuseppe,
Garg Ashim,
Liotta Giuseppe,
Tamassia Roberto,
Vargiu Francesco
Publication year - 2000
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/1097-024x(200009)30:11<1235::aid-spe339>3.0.co;2-b
Subject(s) - graph drawing , computer science , algorithm , graph , visualization , theoretical computer science , graph layout , graph algorithms , data mining
Graph drawing plays an important role in the solution of many information visualization problems. Most of the graph drawing algorithms are accompanied by a theoretical analysis of their characteristics, but only extensive experimentations can assess the practical performance of graph drawing algorithms in real‐life applications. In this paper, we describe the results of some of the most popular experimental studies on graph drawing algorithms. Each study presents an in‐depth comparative analysis on a specific class of algorithms, namely, algorithms for orthogonal drawings, interactive algorithms, algorithms for hierarchical drawings, and force‐directed and randomized algorithms. Copyright © 2000 John Wiley & Sons, Ltd.