DROPS

Document

High-performance Graph Algorithms and Applications in Computational Science (Dagstuhl Seminar 14461)

Authors: Ulrich Carsten Meyer, Henning Meyerhenke, Ali Pinar, and Ilya Safro

Published in: Dagstuhl Reports, Volume 4, Issue 11 (2015)

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.

Cite as

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)

Copy BibTex To Clipboard

@Article{meyer_et_al:DagRep.4.11.40,
  author =	{Meyer, Ulrich Carsten and Meyerhenke, Henning and Pinar, Ali and Safro, Ilya},
  title =	{{High-performance Graph Algorithms and Applications in Computational Science (Dagstuhl Seminar 14461)}},
  pages =	{40--58},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2015},
  volume =	{4},
  number =	{11},
  editor =	{Meyer, Ulrich Carsten and Meyerhenke, Henning and Pinar, Ali and Safro, Ilya},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.4.11.40},
  URN =		{urn:nbn:de:0030-drops-49697},
  doi =		{10.4230/DagRep.4.11.40},
  annote =	{Keywords: graphs, graph algorithms, graph theory, computational science, complex networks, network science, graph partitioning, linear algebra, parallel program}
}

Search Results

Documents authored by Pinar, Ali

High-performance Graph Algorithms and Applications in Computational Science (Dagstuhl Seminar 14461)

Abstract

Cite as

Thanks for your feedback!

Could not send message