Graph Archive
Authors:Christian Bachmaier, Franz J. Brandenburg, Philip Effinger, Carsten Gutwenger, Jyrki Katajainen, Karsten Klein, Miro Spönemann, and Michael Wybrow
Published in:Graph Drawing with Algorithm Engineering Methods (Dagstuhl Seminar 11191), Dagstuhl Reports 1,5, Schloss Dagstuhl---Leibniz-Zentrum für Informatik (2011), 52-53

In order to evaluate, compare, and tune graph (drawing) algorithms, experiments on well designed benchmark sets have to be performed. This, together with the goal of reproducibility of experimental results, creates a demand for an adequate archive to gather and store graph instances. Such an archive would ideally allow annotation of instances or sets of graphs with additional information like graph properties and references to the respective experiments and results. We examine the requirements and formulate the next steps needed to produce an easily accessible library of graphs that provides the required services. Through successful community involvement, it is expected that the archive will contain a representative selection of both real-world and generated graph instances, covering significant application areas as well as relevant classes of graphs.

Related:<html.gif>HTML (Conference paper)  <html.gif>HTML (Extended version)  
  author = {Christian Bachmaier and Franz J. Brandenburg and Philip Effinger
    and Carsten Gutwenger and Jyrki Katajainen and Karsten Klein and Miro
    Sp\"{o}nemann and Michael Wybrow},
  title = {Graph {A}rchive},
  booktitle = {Graph Drawing with Algorithm Engineering Methods (Dagstuhl
    Seminar 11191)},
  series = {Dagstuhl Reports},
  volume = {1},
  number = {5},
  publisher = {Schloss Dagstuhl---Leibniz-Zentrum f\"{u}r Informatik},
  year = {2011},
  pages = {52--53},
This page was generated by Jyrki Katajainen <> on 31.12.2011.