DagRep.8.6.19.pdf
- Filesize: 8.79 MB
- 21 pages
Document
High-Performance Graph Algorithms (Dagstuhl Seminar 18241)
Authors and all authors of the abstracts in this report
-
Part of:
Issue:
Dagstuhl Reports, Volume 8, Issue 6
Volume: Dagstuhl Reports, Volume 8
Journal: Dagstuhl Reports (DagRep) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2018-12-19
Cite As Get BibTex
Henning Meyerhenke, Richard Peng, and Ilya Safro. High-Performance Graph Algorithms (Dagstuhl Seminar 18241). In Dagstuhl Reports, Volume 8, Issue 6, pp. 19-39, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
https://doi.org/10.4230/DagRep.8.6.19
Abstract
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.
Subject Classification
Keywords
- algorithm engineering
- combinatorial scientific computing
- graph algorithms
- high-performance computing
- theoretical computer science
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads