12th Annual Graph Drawing Contest

GD 2005 Graph Drawing Contest Call for Participation

• Call for participation

GD 2005 Contest Overview

• Challenge summary:
  • The graph drawing challenge will take place in one hour during the conference and the challenge will be crossing minimization.
  • Teams of one to three participants will be allowed and teams may bring their own software and computers for the challenge.
  • Lab space and a simple graph editor, GraphMan, will be provided for teams that did not bring computers/software. Information about the editor, sample input files and overview of the file format are available here.
• Evolving-graph drawing competition:
  • The challenge of drawing large evolving graphs can be addressed in various ways. Any visualizations based on the contest data, including animations, static images, subgraphs and derivations of the contest graph, are welcome as submission.
  • In addition to the visualizations, we encourage contestants to submit supplemental material, such as background relevance of the graph, case studies, concepts, algorithms, experiments, structural results, that address the problem of visualizing this type of data in a meaningful way.
  • The data set for this challenge, represents a real-world bipartite graph based on the Internet Movie Database, where nodes are actors and movies and edges represent relations between movies and actors.
• Free-style drawing contest:
  • The free-style contest is an opportunity for participants to present their best graph visualizations.
  • All types of graph drawings can be submitted to this contest, and judging will be based on artistic merit and relevance to the graph drawing community.

GD2005 Contest Submissions

• Names and email addresses of the contributors;
• A picture illustrating the graph (graphs);
• A brief description of the graph, how it was generated, and its relevance to the graph drawing community;

Graph Drawing Contest Committee