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.

We deal with the problem of constructing the orthogonal drawing of a graph with the minimum number of bends along the edges. The problem has been recently shown to be NP-complete in the general case. In this paper we introduce and study the new concept of spirality, which is a measure of how an orthogonal drawing is "rolled up," and develop a theory on the interplay between spirality and number of bends of orthogonal drawings. We exploit this theory to present polynomial time algorithms for two significant classes of graphs: series-parallel graphs and 3-planar graphs. Series-parallel graphs arise in a variety ofproblems such as scheduling, electrical networks, data-flow analysis, database logic programs, and circuit layout. Also, they play a central role in planarity problems. Furthermore, drawings of 3-planar graphs are a classical field of investigation.

Article Free Access Share on An experimental comparison of three graph drawing algorithms (extended abstract) Authors: Giuseppe Di Battista D.I.F. A., Univ. della Basilicata, 85100 Potenza, Italy D.I.F. A., Univ. della Basilicata, 85100 Potenza, ItalyView Profile , Ashim Garg Dept. of Computer Science, Brown University, Providence, RI Dept. of Computer Science, Brown University, Providence, RIView Profile , Giuseppe Liotta Dip. Informatica e Sistemistica, Univ. di Roma 'La Sapienza', 00198 Roma, Italy Dip. Informatica e Sistemistica, Univ. di Roma 'La Sapienza', 00198 Roma, ItalyView Profile Authors Info & Claims SCG '95: Proceedings of the eleventh annual symposium on Computational geometrySeptember 1995 Pages 306–315https://doi.org/10.1145/220279.220312Online:01 September 1995Publication History 10citation960DownloadsMetricsTotal Citations10Total Downloads960Last 12 Months8Last 6 weeks2 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF