2026-07-20T11:02:44Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:10047 2024-03-06T10:26:57Z ddc:004 open_access

High-Performance Graph Algorithms (Dagstuhl Seminar 18241) Meyerhenke, Henning Peng, Richard Safro, Ilya algorithm engineering combinatorial scientific computing graph algorithms high-performance computing theoretical computer science 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 implementation 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Henning Meyerhenke and Richard Peng and Ilya Safro 2018 Is Part Of Dagstuhl Reports, Volume 8, Issue 6 (2019) Article Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagRep.8.6.19 urn:nbn:de:0030-drops-100475 https://drops.dagstuhl.de/entities/document/10.4230/DagRep.8.6.19 eng https://creativecommons.org/licenses/by/3.0/legalcode