This page is devoted to the mathematical field of automatic graph drawing. An excellent introduction to graph drawing can be found in the following article (in German, sorry):
Petra Mutzel: Zeichnen von Diagrammen: Theorie und Praxis
Planar Graph Drawing
Takao Nishizeki, Md. Saidur Rahman
Lecture Notes Series on Computing, Vol. 12
World Scientific, 2004
This list contains only the annual Graph Drawing Symposiums. Further interesting conferences and workshops can be found here.
Graph Drawing: 13th International Symposium, GD 2005
Limerick, Ireland, September 12—14, 2005
Patrick Healy, Nikola S. Nikolov (Eds.), LNCS 3843, Springer 2006
Selected papers:
Journal of Graph Algorithms and Applications 11(2), 2007,
Discrete Mathematics 309(7), 2009
Graph Drawing: 12th International Symposium, GD 2004
New York, NY, USA, September 29—October 2, 2004
János Pach (Ed.), LNCS 3383, Springer 2005
Selected papers:
Journal of Graph Algorithms and Applications 9(3), 2005,
Algorithmica 47(4), 2007
ALCOM International Workshop on Graph Drawing
Sèvres, Parc of Saint Cloud, Paris, September 25—29, 1993
Guiseppe Di Battista, Peter Eades, Hubert de Fraysseix, Pierre Rosenstiehl, Roberto Tamassia
(PDF)
Report on the International Work Meeting on Graph Drawing
Marino (Rome), Italy, June 4—5 1992
Giuseppe Di Battista, Roberto Tamassia
(PDF)
Graph Drawing with Algorithm Engineering Methods
Camil Demetrescu (University of Rome “La Sapienza”, IT),
Michael Kaufmann (Universität Tübingen, DE),
Stephen Kobourov (University of Arizona - Tucson, US),
Petra Mutzel (TU Dortmund, DE)
Seminar 11191, 8.–13.05.2011
Graph Drawing
Michael Jünger (University of Köln, DE),
Stephen Kobourov (University of Arizona - Tucson, US),
Petra Mutzel (University of Dortmund, DE)
Seminar 05191, 8.–13.05.2005
Dagstuhl Seminar Proceedings
Artificial Graphs (
.zip file [6.6MB])
A collection of non-planar graphs with known crossing numbers. This benchmark set has been used in the experimental study on crossing minimization by
Carsten Gutwenger.
Planexp Benchmark Set (
.zip file [2.4MB])
A collection of non-planar graphs with planar subgraphs used in an experimental evaluation of crossing minimization heuristics by Markus Chimani and Carsten Gutwenger.
This list contains some selected Graph Drawing software systems with focus on actively maintained projects.
OGDF by Technische Universität Dortmund and University of Cologne (Petra Mutzel and Michael Jünger)
OGDF is a C++ class library that contains many sophisticated data structures and algorithms for drawing graphs.
Pajek by Vladimir Batagelj and Andrej Mrvar
A Windows program for the analysis and visualization of large networks.
Pigale by Hubert de Fraysseix and Patrice Ossana de Mendez
Pigale is a graph editor and a C++ algorithm library concerned with planar graphs.
Tulip by David Auber, LaBRI, University of Bordeaux I
Tulip is an information visualization framework dedicated to the analysis and visualization of relational data.
aiSee by AbsInt Angewandte Informatik GmbH
GoVisual by oreas GmbH
The GoVisual software library is a commercial Graph Drawing library available for various platforms (C++, COM, .NET, Java)
Graph Layout Toolkit by Tom Sawyer Software
Graph Layout Toolkit is a commercial Graph Drawing library available for various platforms (C++, .NET, Java)
ILOG Visualization by IBM
Visualization and graph layout software for Java (JViews) and C++ (Views)
yFiles by yWorks GmbH
yFiles is a Java library of Graph Drawing algorithms.
Kieler by University of Kiel
An tntegrated environment for Layout for the Eclipse rich-client platform.
Scaffold Hunter by Technische Universität Dortmund and Max-Planck Institute for Molecular Physiology Dortmund
A Java-based software tool for the analysis of structure-related biochemical data.
-
Ulrik Brandes, Fachbereich Informatik & Informationswissenschaft,
Universität Konstanz
-
-
Markus Chimani, Department of Computer Science,
Technische Universität Dortmund
Walter Didimo, Dipartimento Ingegneria Elettronica e dell’Informazione,
Università degli Studi di Perugia
Peter Eades, School of Information Technologies,
University of Sydney
David Eppstein, Department of Computer Science,
University of California, Irvine
-
-
-
-
-
Patrick Healy, Computer Science Department,
University of Limerick
-
Michael Kaufmann, Wilhelm-Schickard-Institut für Informatik,
University of Tübingen
-
Karsten Klein, Department of Computer Science,
Technische Universität Dortmund
-
-
Giuseppe Liotta, Dipartimento Ingegneria Elettronica e dell’Informazione,
Università degli Studi di Perugia
Petra Mutzel, Department of Computer Science,
Technische Universität Dortmund
-
-
János Pach, Courant Institute of Mathematical Sciences,
New York University
Roberto Tamassia, Department of Computer Science,
Brown University, Providence, RI
-
Dorothea Wagner, Institute for Theoretical Informatics,
Karlsruhe Institute of Technology
-
-
Hoi-Ming Wong, Department of Computer Science,
Technische Universität Dortmund
Bernd Zey, Department of Computer Science,
Technische Universität Dortmund
Further interesting resources are available at the following web sites: