DagRep.4.11.40.pdf
- Filesize: 1.02 MB
- 19 pages
Document
High-performance Graph Algorithms and Applications in Computational Science (Dagstuhl Seminar 14461)
Authors and all authors of the abstracts in this report
-
Part of:
Issue:
Dagstuhl Reports, Volume 4, Issue 11
Volume: Dagstuhl Reports, Volume 4
Journal: Dagstuhl Reports (DagRep) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2015-03-20
Cite AsGet BibTex
Ulrich Carsten Meyer, Henning Meyerhenke, Ali Pinar, and Ilya Safro. High-performance Graph Algorithms and Applications in Computational Science (Dagstuhl Seminar 14461). In Dagstuhl Reports, Volume 4, Issue 11, pp. 40-58, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
https://doi.org/10.4230/DagRep.4.11.40
https://doi.org/10.4230/DagRep.4.11.40
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 14461 "High- performance Graph Algorithms and Applications in Computational Science". The seminar reflected the recent 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 on 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 with a focus on practical algorithms and their efficient implementation for large-scale problems. The abstracts included in this report contain recent state-of-the-art results, but also point to promising new directions for high-performance graph algorithms and their applications.
Keywords
- graphs
- graph algorithms
- graph theory
- computational science
- complex networks
- network science
- graph partitioning
- linear algebra
- parallel program
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads