Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH scholarly article en Meyerhenke, Henning; Peng, Richard; Safro, Ilya http://www.dagstuhl.de/dagrep License
when quoting this document, please refer to the following
DOI:
URN: urn:nbn:de:0030-drops-100475
URL:

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

High-Performance Graph Algorithms (Dagstuhl Seminar 18241)

pdf-format:


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
Seminar: Dagstuhl Reports, Volume 8, Issue 6
Issue date: 2018
Date of publication: 2018


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