GLaDOS: Graph Layout algorithm Datasets for Open Science

The diagram shows the inclusion criteria for the papers used in this survey. On the left, four boxes span the venues from which papers were collected as described in the image caption, then arrows point to other boxes with the inclusion criteria such as paper Introduces a 2D layout algorithm, changes positions of nodes, edges or bothe, and compares different algorithms.
Figure 1: The sources used for the collection of papers. We started from the last 7 years of graph drawing, then integrated with the results from IEEE and Eurographics search, and then we also included all the most cited papers in Graph Drawing. The final result was 196 papers containing layout algorithm evaluations.
Abstract
Computational evaluations are crucial for standardized and objective evaluation of graph layout algorithms. Standard benchmark datasets facilitate comparison with prior work, and reliable access to datasets is fundamental for replicability. However, there is no comprehensive repository of benchmark datasets for Graph Drawing, and many datasets have been lost.
Materials
DOI | Supplement | Code | BibTeX
Authors
Sara DiBartolomeo
Connor Wilson
Eduardo Puerta
Tarik Crnovrsanin
Alexander Frings
Cody Dunne
Citation
Thumbnail image for publication titled: GLaDOS: Graph Layout algorithm Datasets for Open Science
GLaDOS: Graph Layout algorithm Datasets for Open Science

Sara DiBartolomeo, Connor Wilson, Eduardo Puerta, Tarik Crnovrsanin, Alexander Frings, and Cody Dunne. Journal of Visualization and Interaction. 2026. DOI: https://doi.org/10.54337/jovi.v1i1.11236

DOI | Supplement | Code | BibTeX

Khoury Vis Lab — Northeastern University
* West Village H, Room 302, 440 Huntington Ave, Boston, MA 02115, USA
* 100 Fore Street, Portland, ME 04101, USA
* Carnegie Hall, 201, 5000 MacArthur Blvd, Oakland, CA 94613, USA