18th Intl. Symp. Graph Drawing U Konstanz



GD 2010 Home
Contest Overview


Edge Routing Graph 1
Edge Routing Graph 2
Mystery Graph
File Format

Online Challenge

Challenge Overview
File Format
Sample File

17th Graph Drawing Contest

Call for Participation

Download PDF version

The 17th Annual Graph Drawing Contest shall be held in conjunction with the 18th International Symposium on Graph Drawing (GD 2010). Except for the challenge competition, which takes place during the conference, all submissions are due by September 19, 2010 (CET).

This year, the contest has three topics: edge routings, the mystery graph, and the graph drawing challenge.

Edge Routing

For details, see here.

The topic of last year's contest was partial graph layout, that is to produce a layout from data with some fixed node positions and some nodes that were free to be moved. This year's contest is a variant: All nodes are fixed, that is, all nodes have specified coordinates. The task is to produce a suitable routing for all edges, by using bends or splines or any other way to display edges nicely. Note that no node should be moved at all.

The Edge Routing topic contains two data sets that will be judged separately. The task is to create edge routings suitable for the corresponding application domains. Manual layout adjustments are allowed, but fully automatic layouts are preferred. For each data set, a separate winner will be determined. The following links provide details about the data sets:

Mystery Graph

For details, see here.

The mystery graph consists of 17 nodes and 49 edges. The node names are slightly obfuscated. The first task is to create a visualization of the graph. There is no requirement concerning edge shapes or layout style. Manual layout adjustments are allowed, but fully automatic layouts are preferred. As an additional task, the contestants should determine what this graph depicts. The following links provides details about the mystery graph:


Submissions for the mystery graph and the edge routing tasks must be received by midnight September 19 (Central European Time) and should include the following information:

  • names and email addresses of the contributors,
  • a picture illustrating the graph, and
  • a brief description on how the layout was produced.

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 images.

All contest submissions should be sent to:

Georg Sander
Wilhelm Flögel Ring 52
60437 Frankfurt, Germany

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 length of the longest edge in an orthogonal layout. The longest edge can be a bottleneck for many applications, hence minimizing its length is important. For details, see here.

Contest Committee

Questions or comments should be sent to:

Legal notice