License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagRep.8.6.19
URN: urn:nbn:de:0030-drops-100475
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/10047/
Go back to Dagstuhl Reports

Meyerhenke, Henning ; Peng, Richard ; Safro, Ilya
Weitere Beteiligte (Hrsg. etc.): Henning Meyerhenke and Richard Peng and Ilya Safro

High-Performance Graph Algorithms (Dagstuhl Seminar 18241)

pdf-format:
dagrep_v008_i006_p019_18241.pdf (9 MB)

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.

BibTeX - Entry

@Article{meyerhenke_et_al:DR:2018:10047,
  author =	{Henning Meyerhenke and Richard Peng and Ilya Safro},
  title =	{{High-Performance Graph Algorithms (Dagstuhl Seminar 18241)}},
  pages =	{19--39},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2018},
  volume =	{8},
  number =	{6},
  editor =	{Henning Meyerhenke and Richard Peng and Ilya Safro},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/10047},
  URN =		{urn:nbn:de:0030-drops-100475},
  doi =		{10.4230/DagRep.8.6.19},
  annote =	{Keywords: algorithm engineering, combinatorial scientific computing, graph algorithms, high-performance computing, theoretical computer science}
}

Keywords: algorithm engineering, combinatorial scientific computing, graph algorithms, high-performance computing, theoretical computer science
Collection: Dagstuhl Reports, Volume 8, Issue 6
Issue Date: 2018
Date of publication: 19.12.2018

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI