Graph Drawing Contest 1995
Vladimir Batagelj and Andrej Mrvar
University of Ljubljana, Slovenia
Last change: 2. October 1995
Data and rules
See the page
GD95 Graph-Drawing Contest and
GD95 Graph-Drawing Conference.
See also our layouts for Graph-Drawing Contests:
How layouts of graphs were obtained
- Graph A
- Automatically obtained layout using our program COORD.
(positioning vertices on the rectangular net so that the number
of crossings of lines is as low as possible).
- Manual editing to reposition vertices using our graph picture
- Graph B
- Analysing graph B using our program RELCALC two central vertices
were found (1 and 34).
- Feasible possitions for vertices were generated
(two families of concentric circles).
- Vertices 1 and 34 were fixed in the centre of the concentric circles
- Other vertices were automatically positioned around using program COORD
so that the total length of the lines was minimized.
- Manual editing using DRAW to reposition vertices to minimize crossings
(concentric circles cannot be seen any more).
- Graph C
- Automatically obtained layout using our program ENERG
(minimisation of energy).
- Some manual editing using DRAW to reposition vertices.
- Graph A:
- Graph B:
- Graph C:
Department of Mathematics, University of Ljubljana
Andrej Mrvar, Faculty of Social Sciences, University of Ljubljana