Graph Drawing Contest 1997
Vladimir Batagelj and Andrej Mrvar
University of Ljubljana, Slovenia
Last change: 1. October 1997
Data and rules
See the page
GD97 Graph-Drawing Contest and
GD97 Graph-Drawing Conference.
See also our layouts for Graph-Drawing Contests:
How layouts of graphs were obtained
Batagelj V., Doreian P., Ferligoj A.:
An Optimizational Approach to Regular Equivalence.
Social Networks 14(1992), 121-135.
- Graph A
- Automatically obtained layout using
draw/eigenvalues option in program Pajek.
Manual editing to reposition vertices in the grid to obtain
orthogonal layout in plane.
- Manual editing in 3D to get orthogonal embeddings in space:
minimal, symmetric and cube.
- Graph B
- Analyzing graph B using our program MODEL
(almost) regular partition in 3 classes. The third class
contains only vertex Harmony Central. The second
class, represented by squares, contains 11 vertices that
are connected only to the vertices in the class 1 (represented
by circles). Vertices in class 1 are also connected to other
vertices in the same class. We first draw all vertices in
the class 1 in the center and vertices in class 2 separately --
using class shrinking and circular drawing options in
Pajek. Afterward we manually moved vertices of class
1 connected to only one vertex of class 2 close to this vertex.
Finally we manually arranged the remaining vertices of class 1.
- We transformed given similarities s on arcs to
dissimilarities d = 1 /(1 + s) and applied Ward's
hierarchical clustering method to the obtained
We produced a clustering into 12 clusters, shrank the
graph using Pajek, and draw the obtained
the number of crossings. Finally we manually arranged the vertices
of original graph.
See also our Graph drawing report PS/ZIP or
Department of Mathematics, University of Ljubljana
Andrej Mrvar, Faculty of Social Sciences, University of Ljubljana