Evaluating Graph Layout Algorithms: A Systematic Review of Methods and Best Practices

Simple item page
dc.contributor.authorDi Bartolomeo, Saraen_US
dc.contributor.authorCrnovrsanin, Tariken_US
dc.contributor.authorSaffo, Daviden_US
dc.contributor.authorPuerta, Eduardoen_US
dc.contributor.authorWilson, Connoren_US
dc.contributor.authorDunne, Codyen_US
dc.contributor.editorAlliez, Pierreen_US
dc.contributor.editorWimmer, Michaelen_US
dc.date.accessioned2024-12-19T11:16:10Z
dc.date.available2024-12-19T11:16:10Z
dc.date.issued2024
dc.description.abstractEvaluations—encompassing computational evaluations, benchmarks and user studies—are essential tools for validating the performance and applicability of graph and network layout algorithms (also known as graph drawing). These evaluations not only offer significant insights into an algorithm's performance and capabilities, but also assist the reader in determining if the algorithm is suitable for a specific purpose, such as handling graphs with a high volume of nodes or dense graphs. Unfortunately, there is no standard approach for evaluating layout algorithms. Prior work holds a ‘Wild West’ of diverse benchmark datasets and data characteristics, as well as varied evaluation metrics and ways to report results. It is often difficult to compare layout algorithms without first implementing them and then running your own evaluation. In this systematic review, we delve into the myriad of methodologies employed to conduct evaluations—the utilized techniques, reported outcomes and the pros and cons of choosing one approach over another. Our examination extends beyond computational evaluations, encompassing user‐centric evaluations, thus presenting a comprehensive understanding of algorithm validation. This systematic review—and its accompanying website—guides readers through evaluation types, the types of results reported, and the available benchmark datasets and their data characteristics. Our objective is to provide a valuable resource for readers to understand and effectively apply various evaluation methods for graph layout algorithms. A free copy of this paper and all supplemental material is available at , and the categorized papers are accessible on our website at .en_US
dc.description.number6
dc.description.sectionheadersMajor Revision from EuroVis Symposium
dc.description.seriesinformationComputer Graphics Forum
dc.description.volume43
dc.identifier.doi10.1111/cgf.15073
dc.identifier.pages31 pages
dc.identifier.urihttps://doi.org/10.1111/cgf.15073
dc.identifier.urihttps://diglib.eg.org/handle/10.1111/cgf15073
dc.publisher© 2024 Eurographics ‐ The European Association for Computer Graphics and John Wiley & Sons Ltd.en_US
dc.rightsAttribution-NonCommercial 4.0 International License
dc.rights.urihttps://creativecommons.org/licenses/by-nc/4.0/
dc.subjectvisualization
dc.subjectgraph drawing
dc.subjectgraph layout algorithms
dc.subjectevaluation
dc.titleEvaluating Graph Layout Algorithms: A Systematic Review of Methods and Best Practicesen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
26_cgf15073.pdf
Size:
4.41 MB
Format:
Adobe Portable Document Format
Download
Collections
43-Issue 6