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.4.11.40
URN: urn:nbn:de:0030-drops-49697
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2015/4969/
Go back to Dagstuhl Reports

Meyer, Ulrich Carsten ; Meyerhenke, Henning ; Pinar, Ali ; Safro, Ilya
Weitere Beteiligte (Hrsg. etc.): Ulrich Carsten Meyer and Henning Meyerhenke and Ali Pinar and Ilya Safro

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

pdf-format:
dagrep_v004_i011_p040_s14461.pdf (1 MB)

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.

BibTeX - Entry

@Article{meyer_et_al:DR:2015:4969,
  author =	{Ulrich Carsten Meyer and Henning Meyerhenke and Ali Pinar and Ilya Safro},
  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 =	{Ulrich Carsten Meyer and Henning Meyerhenke and Ali Pinar and Ilya Safro},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2015/4969},
  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}
}

Keywords: graphs, graph algorithms, graph theory, computational science, complex networks, network science, graph partitioning, linear algebra, parallel program
Collection: Dagstuhl Reports, Volume 4, Issue 11
Issue Date: 2015
Date of publication: 20.03.2015

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