15th Graph Drawing Contest
Call for Participation
Download PDF version
The 15th Annual Graph Drawing Contest shall be held in conjunction
with the 16th International Symposium on Graph Drawing.
Except for the challenge competition, which takes place during the
conference, all submissions are due by September 15, 2008 (CET).
Contest Overview
This year, the contest has five graph categories.
The following links provide details and data for each category.
- Mystery Graph
The mystery graph has 71 nodes and 145 directed and labelled edges,
and represents a series of social or cultural events that got a fair
amount of news coverage this year.
The task is to determine which events are represented by this graph,
and to create the best drawing that depicts the logical structure of
this graph.
For details, see here.
- Network from Electrical Engineering
This electrical network consists of 35 nodes and 48 undirected
edges. The nodes are deeply nested.
It represents the architecture of a VLIW processor.
The task is to produce a fully automatic drawing of this network.
For details, see here.
- Network from Social Sciences
This graph represents the relationships between companies and
top managers and union officers in Germany.
It consists of 129 nodes and 271 edges.
The task is to produce the best visualization of this network while
including as much information as possible.
Static drawings, animations or entire tools to explore the graph are accepted
as submissions.
For details, see here.
- Biological Network
This graph represents the mTOR signalling pathways with 90 entities,
54 interactions and 85 inclusions.
The task is to produce the best fully automatic drawing suitable
for the biological domain.
For details, see here.
- Graph Drawing Challenge
The challenge will be held during the conference in a format similar
to a typical programming contest, where teams are presented with
a collection of challenge-graphs and have approximately one hour
to submit their highest scoring drawings.
This year the challenge shall focus on minimizing the number of
crossings of upward grid drawings of graphs with edge bends.
For details, see here.
Submissions
Submissions for all categories, except for the Challenge,
must be received by midnight September 15
(Central European Time)
and should include the following information:
- names and email addresses of the contributors,
- a picture (or movie) illustrating the graph(s), and
- a brief description of the graph and how it was generated.
Electronic submissions are strongly encouraged.
However, if your drawing requires special printing
because of size, resolution, or color constraints, you are
encouraged to submit via hard-copy.
Acceptable electronic formats include PDF and PostScript
for static images.
For dynamic graphs or animations, please use mpg or avi files.
Movies should be made using standard codecs.
All contest submissions should be sent to:
Georg Sander
ILOG Deutschland GmbH
Ober-Eschbacher Str. 109
61352 Bad Homburg, Germany
Contest Committee
- Ugur Dogrusoz, Bilkent University and Tom Sawyer Software
- Christian A. Duncan, Louisiana Tech University
- Carsten Gutwenger, Dortmund University of Technology
- Georg Sander, (Chair), ILOG Deutschland GmbH
Questions or comments should be sent to:
Legal notice
