Experimental studies on graph drawing algorithms

Luca Vismara, Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Roberto Tamassia, Francesco Vargiu · Software Practice and Experience · 2000

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.

Read the paper · More papers on PaperTik