High-Performance Graph Algorithms (Dagstuhl Seminar 18241)

Henning Meyerhenke, Richard Peng, Ilya Safro, Michael Wagner
2018 Dagstuhl Reports  
This report documents the program and outcomes of Dagstuhl Seminar 18241 "High-performance Graph Algorithms". The seminar reflected the ongoing qualitative change how graph algorithms are used in practice due to (i) the complex structure of graphs in new and emerging applications, (ii) the size of typical inputs, and (iii) the computer systems with which graph problems are solved. This change is having a tremendous impact on the field of graph algorithms in terms of algorithm theory and
more » ... tation as well as hardware requirements and application areas. The seminar covered recent advances in all these aspects, trying to balance and mediate between theory and practice. The abstracts included in this report contain and survey recent state-of-the-art results, but also point to promising new directions for high-performance graph algorithms and their applications, both from a theoretical and a practical point of view. Seminar June 10-15, 2018 -http://www.dagstuhl.de/18241 2012 ACM Subject Classification Mathematics of computing → Discrete mathematicsMathematics of computing → Graph theory, Theory of computation → Design and analysis of algorithms, Theory of computation → Models of computation, Theory of computation → Randomness, geometry and discrete structures License Creative Commons BY 3.0 Unported license © Henning Meyerhenke, Richard Peng, and Ilya Safro Many presentations in this Dagstuhl seminar emphasized recent trends regarding typical inputs and their effect on graph algorithm development. From a high-level perspective, one can divide the presentations into two categories: either more focused on algorithm theory or more focused on practical algorithmic results. Many talks considered both theoretical and practical aspects. Furthermore, attention was given to intermix talks with theoretical and practically motivated starting points in order to encourage discussions among attendees. We were happy to see such discussions, as well as synergy of both aspects, carrying over to working groups on open problems.
doi:10.4230/dagrep.8.6.19 dblp:journals/dagstuhl-reports/MeyerhenkePS18 fatcat:nbodjldinjgq7eahxl6obpaqie