Seediscussions,stats,andauthorprofilesforthispublicationat:https://www.researchgate.net/publication/221557271

GraphDrawingContestReport

CONFERENCEPAPER·JANUARY2008

DOI:10.1007/978-3-642-00219-9_52·Source:DBLP

CITATIONS

6

READS

37

4AUTHORS,INCLUDING:

UgurDogrusoz

BilkentUniversity

65PUBLICATIONS2,523CITATIONS

SEEPROFILE

ChristianA.Duncan

QuinnipiacUniversity

48PUBLICATIONS766CITATIONS

SEEPROFILE

CarstenGutwenger

TomTom

62PUBLICATIONS790CITATIONS

SEEPROFILE

Availablefrom:UgurDogrusoz

Retrievedon:04February2016

Graph�Drawing Contest Report

Franz Brandenburg�� Michael J�unger��Joe Marks�� Petra Mutzel�� Falk Schreiber�

� Universit�at PassauPassau� Germany

E�mail� brandenb�schreibe�fmi�uni�passau�de� Universit�at zu K�oln

K�oln� GermanyE�mail� mjuenger�informatik�uni�koeln�de

� MERL�A Mitsubishi Electric Research Laboratory�� Broadway

Cambridge� MA ���� U�S�A�E�mail� marks�merl�com

� Max�Planck�Institut f�ur InformatikIm Stadtwald ��� Saarbr�ucken� Germany

E�mail� mutzel�mpi�sb�mpg�de

Abstract� This report describes the Sixth Annual Graph Drawing Con�test� held in conjunction with the ��� Graph Drawing Symposiumin Prague� Czech Republic� The purpose of the contest is to monitorand challenge the current state of the art in graph�drawing technology �� � �� �� ���

� Introduction

Text descriptions of the four categories for the ���� contest are available via theWorld Wide Web �WWW� ��� Eighteen separate submissions were received �onemore than last year�� containing � di�erent graph drawings �a record number��and one live demonstration The winners for Categories A�C were selected bythe contest organizers The winners for Category D were ranked by the voteof all the symposium attendees Con icts of interest were avoided on an honorbasis The winning entries are described below

� Winning submissions

��� Category A

The graph for Category A was unusually complex for the contest It representsthe characters in the long�running German soap opera� Lindenstrasse This showstarted �� years ago on ARD �one of the main public TV stations�� every weekabout seven million people watch it The data in the graph have been extractedfrom a poster in a popular book ��� The following data are associated with

each character node in the graph� the character�s name and gender� the num�bered episodes in which the character appears� the dates of the character�s birthand death �if known�� and the character�s current status in the show �active�inactive� dead� or unknown� In addition� the importance of the character isalso indicated� and the most important characters have pictures associated withthem The edges that relate characters are also typed to indicate the nature ofthe relationship� business� friendship� partnership� family� or hostility

Three visualization tasks for this graph were mandated�

� To depict the current situation� To visualize the whole graph� including both current and past characters

and relations� To show the development of the graph over some time interval

Only one submission was received for Tasks � and �� none was received for Task �Nevertheless� the quality of the single submission was such that the committeedecided to award the �rst�place prize to its creators� Vladimir Batagelj andAndrej Mrvar ��VladimirBatagelj� AndrejMrvar��uni�ljsi� from the Universityof Ljubljana� Slovenia The drawing in Figure � illustrates the current situationin the show� It was drawn using the �Pajek� system ��� An initial layout wascomputed using the Kamada�Kawai force�directed algorithm� this layout wassubsequently edited by hand to arrange the nodes on a rectangular net Thedynamic drawings �not shown� were also computed using an incremental force�directed method

��� Category B

Category B was this year�s �theory surprise� It consisted of a directed graphwhose edges were colored blue or green No further information was providedThe �� submissions received included an astonishing �� di�erent drawings of thegraph�

The graph is the six�bit shift�register graph It also occurs as the state graphof the minimal deterministic �nite state automaton that recognizes the regularset ��j������j��� Thus� the nodes are labeled most meaningfully as six�bit num�bers from ������ to ������ The blue edges describe the left shifts from nodeswith labels �x They de�ne a binary tree with a self�loop at the root ������Similarly� the green edges describe the left shifts from nodes with labels �x� theyde�ne a binary tree with a self�loop at the root ������ These two trees areglued together Conversely� the shift register graphs can be partitioned into twoedge�disjoint trees However� it is a bad strategy to draw shift�register graphsusing a common tree�drawing algorithm for one of these trees� and then to insertthe remaining edges The shift�register graphs are highly symmetric and somesymmetry should be displayed in any reasonable drawing

� The original version of this drawing is in color� as are most of the winning draw�ings� A copy of this report with color drawings can be obtained from Joe Marks�marks�merl�com�

Rosi Koch

Zorro Franz Josef Pichelsteiner

Onkel Franz Franz Wittich

Gung Pahm Kien

Urzula Wienicki

Gabi Zenker-geb.Skawowski

Phil Seegers

Hans Wilhelm Huelsch

Hajo Scholz

Olli Klatt

Erich-Schiller

Helga Beimer Schiller

Hans Beimer Anna Ziegler

Andy Zenker

Berta Griese

Lisa Hoffmeister

Marion Beimer

Klaus Beimer

Dr. Eva-Maria Sperling

Boris Ecker

Valerie Ecker

Iffi Zenker

Momo Sperling

Dr. Ahmet Dagdelen

Else Kling

Paolo Varese

Dani Schmitz

Philipp Sperling

Tanja Schildknecht-Dressler

Dr. Ludwig Dressler

Mary KlingOlaf Kling

Fausto Rossini

Frank DresslerElena Sarikakis

Isolde Pavarotti

Kaethe Georg Eschweiler

Carsten Floeter Theo Klages

Beate Sarikakis

Vasily Sarikakis

Rolf Sattler Bolle Guenther Bollmann

Hilmar Eggers

Wilhelm Loesch

Marlene Schmitt

Friedemann Traube

Wanda Winicki

Pat Wolffson

Winifred Snyder

Irina Winicki

Sophie ZieglerTom Ziegler

Sarah Ziegler

Paula Madalena Francesca Winicki

Canan Dagdelen

Herr Panowski

Giovanna Varese

Marcella Varese

Nico Zenker

Gina Varese

Chromo Hoyonda

Alfredo

Francesco

Professor Dr. Rudolf Tenge-Wegemmann

Frau Horowitz

Harry

Zeki Kurtalan

Fritjof Lothar Boedefeld

Gundel Koch

Dr. Otto Pichelsteiner

Leo Klamm

Rita Bassermann

Simone Fitz

Dora Wittich

Martha

Bruno Skabowski

Sue

Theresa Zenker

Inge Kling

Ernst+Lisl Wiesenhuber

gesch.Skabowski*19.10.1927

*09.08.1963

*24.07.1913

*23.10.1958

*10.02.1963

verw.Zimmermann*23.05.1960

*14.04.1961

*29.02.1952

*09.06.1944

*06.01.1976

*23.07.1944

geb.Wittich*24.03.1940

*03.10.1943 geb.Jenner*14.07.1959

*03.07.1947

geb.Nolte*25.06.1941

*19.10.1981

*21.05.1969

*17.10.1078

*06.08.1947

*17.06.1965

geb.Zenker*08.10.1975

*19.08.1978

*01.04.1975

*14.05.1922

*14.09.1977

geb.Schildknecht*19.06.1970

*27.06.1933

geb.Dankor*30.01.1969*10.11.1955

*31.10.1966*08.11.1939

verw.Panowak*27.11.1936

*05.03.1966

geb.Floeter*17.08.1970

*14.02.1963

*02.07.1942

geb.Kollin*17.07.1938

*05.05.1972

*18.10.1990

*25.07.1991*27.07.1989

*22.10.1987

*29.08.1996

*12.05.1994*25.10.1970

*06.04.1940

*22.05.1962

+1964

Unbekannter_Russe

+1986

*1947+1964

*1955+1965

*19.09.1996

*10.05.1968+29.08.1991

*30.01.1992

*14.11.1991

*1969+1986

*19.04.1996

*13.03.1994

*18.07.1996

*24.07.1997

*26.11.1987+18.08.1996

Fig� �� First place� Category A �original in color��

Symmetry is indeed visible in the joint third�prize winners� shown in Fig�ures ��� The drawing in Figure � was submitted by Karlis Freivalds and PaulisKikusts �karlisf�paulis�cclulv�� from the University of Latvia� Latvia It wasgenerated using the ActiveX Graphical Diagramming Engine �http���www��gradetools�com�� The structure of the graph was discovered using a variantof barycentric layout� and subsequent re�nement of node and edge positions wasdone by hand Note the resemblance to a �smiley face��

Ago Kuusik �AgoKuusik�ulie�� from the University of Limerick� Ireland�submitted the drawing in Figure � An initial layout was computed using the �Dspring embedder of LEDA GraphWin The layout was then re�ned manually

The drawing in Figure � is called �Fool�s Crown� by its author� Roland Wiese�wiese�informatikuni�tuebingende�� from the Universit�at T�ubingen The draw�ing was generated in the following steps�

� First the two nodes with self�loops were moved manually to opposite sidesand �xed there

� Then the GEM spring embedder was applied to the graph� Finally� beutify the drawing via manual adjustment

The third�place winners all required some manual editing to produce the �naldrawings shown The second�place drawing for Category B required no manualadjustment� and is shown in Figure It was produced by Vladimir Batagelj andAndrej Mrvar ��VladimirBatagelj� AndrejMrvar��uni�ljsi� from the University

Fig� �� Joint third place� Category B �original in color��

of Ljubljana� Slovenia� using the �Pajek� system ��� The layout was computedusing a kind of Principal Components� Analysis� the �rst� second� and �fth eigen�vectors of the Laplacian matrix were used to generate a �D embedding� and thena suitable projection was selected to generate the �nal �D drawing

The winning entry for Category B was submitted by Ulrik Brandes �ub��csbrownedu�� from Brown University He was the only contestant to determinethe true underlying structure of the graph and its origin In addition to awarding�rst place to Brandes�s submission� the judges felt that the written account ofhis investigation was of such high quality as to warrant publication in full It canbe found elsewhere in this volume� and contains several drawings of the contestgraph ���

��� Category C

Biochemistry is becoming an important area of application for graph drawingThe Category�C graph depicts the main biochemical reactions of cells The nodesin the graph are labeled� and colored according to type� eg� green for carbohy�drates� blue for amino acids� etc The graph edges are also typed� edges can beundirected� unidirectional� or bidirectional

The drawing in Figure � was awarded joint �rst place in this category It wassubmitted by Karlis Freivalds and Paulis Kikusts �karlisf�paulis�cclulv�� fromthe University of Latvia� Latvia It was generated using the ActiveX Graphi�cal Diagramming Engine �http���www�gradetools�com�� The structure of the

Fig� �� Joint third place� Category B �original in color��

graph was discovered using a variant of barycentric layout� and subsequent re��nement of node and edge positions was done interactively

The other �rst�place drawing was submitted by RowenaMankelow �c�������studentmailboxnewcastleeduau�� from the University of Newcastle� AustraliaAn initial layout was computed using a force�directed method Nodes were thenrepositioned by hand to emphasize important biochemical pathways� such as thetricarboxylic acid cycle

��� Category D

The only requirement for submissions in this category is that they be some formof artistic expression inspired by or related to graph drawing There were onlytwo entries in this category� but both were deemed worthy of prizes

Second place was awarded to Michael Goodrich �goodrich�jhuedu� for theremarkable image of a seashell shown in Figure � The pattern on the shell�reminiscent of tree layouts� was generated naturally

Fig� �� Joint third place� Category B �original in color��

15070

1507315076

15079

15082

15085

15088

15091

15094

15097

15100

15103

15106

15109

15112

15115

1511815121

15124

15127

15130

15133

15136

15139

15142

15145

15148

15151

15154

15157

15160

15163

15166

15169

15172

15175

15178

15181

15184

1518715190

15193

15196

15199

15202

15205

15208

15211

15214

15217

15220

15223

15226

15229

1523215235

15238

15241

15244

15247

15250

15253

15256

15259

Fig� �� Second prize� Category B �original in color��

First place in Category D went to Ulrik Brandes �ub�csbrownedu�� fromBrown University This drawing� called �Shiftset�� depicts the state�transitiondiagram of an eight�bit shift register� arranged circularly according to binarystates In the original� edges are colored to indicate the insertion of � �yellow�or � �orange�� respectively Further details can be found in Brandes�s account ofhis Category B submission ���� on which this graph and drawing are based

� Observations and Conclusions

As in past years� most of the winners combined automated and manual tech�niques to great e�ect Given this distinct pattern in how graph�drawing softwareis used� it is perhaps surprising that few systems have been designed to giveexplicit support to this kind of human�computer cooperative design A futuregraph�drawing contest may therefore include an interactive�editing category

Another trend that continued from previous years is that of using graphdrawing as an analysis tool No submission exempli�es this approach betterthan the �rst�place winner in Category B

Category D� the artistic category� received fewer submissions this year� butmade up in originality and beauty what was lacking in numbers

� Acknowledgments

Sponsorship for this contest was provided by AT�T Research� MERL�A Mit�subishi Electric Research Laboratory� and Tom Sawyer Software

References

� U� Brandes� Hunting down graph B� In this volume��� P� Eades and J� Marks� Graph�drawing contest report� In R� Tamassia and I� G�

Tollis� editors� Lecture Notes in Computer Science� ��� �Proceedings of the DIMACSInternational Workshop on Graph Drawing ����� pages ����� Berlin� October���� Springer�

� P� Eades and J� Marks� Graph�drawing contest report� In F� J� Brandenburg� ed�itor� Lecture Notes in Computer Science� �� �Proceedings of the Symposium onGraph Drawing GD ����� pages ������ Berlin� September ���� Springer�

�� P� Eades� J� Marks� P� Mutzel� and S� North� Graph�drawing contest report� InS� H� Whitesides� editor� Lecture Notes in Computer Science� ��� �Proceedings ofthe Symposium on Graph Drawing GD ����� pages ������ Berlin� August ����Springer�

�� P� Eades� J� Marks� and S� North� Graph�drawing contest report� In S� North�editor� Lecture Notes in Computer Science� ���� �Proceedings of the Symposium onGraph Drawing GD ����� pages ����� Berlin� September ���� Springer�

�� P� Eades� J� Marks� and S� North� Graph�drawing contest report� In G� DiBattista�editor� Lecture Notes in Computer Science� � � �Proceedings of the Symposium onGraph Drawing GD ���� pages ������� Berlin� September ���� Springer�

�� http���www�ms�mff�cuni�cz�acad�kam�conferences�GD���contest�rules�html��� J� C� Huth� editor� Das Lindenstrasse�Universum� K�oln� ������ http���vlado�fmf�uni�lj�si�pub�networks�pajek��

������

�������

��� ��

� ����

� �������

����� �

����������

����

�����

��� ��� �

�� ��

������

���������

������

������

�� ��

���

������

������

�������

�������

���

� �������

����� �

!��

����� �

���� ��

���������

�� ��

���������

���� ��

���������

����� �

�� �����

���������

����� �

������

���������

����� �

����������

����

����� �

�� �����

���������

����� �

!��

���

����� �

������� ��

������

����� ��

��

���

� �����������

����

������

�� �������

��������� ������

�� ���� ������

�� �� ��

��� ����

��

"�����

���������

�����

�

������� � ��� ����

��� ���

����

����� �

��� ����

� ���� ��

#��

� �������

�����

�� �������

���� �����

������

�����

������ ���������

�����

����

� ����

����

����� �

����� �����

����

���� �

��������

����

���

������

�������

��� �

����

��� ��� �

$��

���� �

���

� ����������� � ��

��

#��

��� ������

��� �����

����������

����

���� ��

���������

����

����

�����

���

�� �����

���������

����������

��������

����

����

������

�������� ������

�����

���� �

���� ����

���� ��

���������

����� �

���� ��

���������

�������

����

����

����

Fig� �� Joint �rst place� Category C �original in color��

Fig� �� Joint �rst place� Category C �original in color��

Fig� �� Second place� Category D �original in color��

Fig� � First place� Category D �original in color��