Edited in cooperation with Christian L. Staudt

This report documents the program and the outcomes of Dagstuhl Seminar 14461 “High- per-formance 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 re-port contain recent state-of-the-art results, but also point to promising new directions for high-performance graph algorithms and their applications