43-Issue 6

Permanent URI for this collection

https://diglib.eg.org/handle/10.2312/3607093

Browse

Browsing 43-Issue 6 by Subject "evaluation"

Now showing 1 - 1 of 1
  • Thumbnail Image
    Item
    Evaluating Graph Layout Algorithms: A Systematic Review of Methods and Best Practices
    (© 2024 Eurographics ‐ The European Association for Computer Graphics and John Wiley & Sons Ltd., 2024) Di Bartolomeo, Sara; Crnovrsanin, Tarik; Saffo, David; Puerta, Eduardo; Wilson, Connor; Dunne, Cody; Alliez, Pierre; Wimmer, Michael
    Evaluations—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 .