Temporal Graphs: Structure, Algorithms, Applications (Dagstuhl Seminar 21171)

Authors Arnaud Casteigts, Kitty Meeks, George B. Mertzios, Rolf Niedermeier and all authors of the abstracts in this report



PDF
Thumbnail PDF

File

DagRep.11.3.16.pdf
  • Filesize: 1.25 MB
  • 31 pages

Document Identifiers

Author Details

Arnaud Casteigts
  • University of Bordeaux, FR
Kitty Meeks
  • University of Glasgow, GB
George B. Mertzios
  • Durham University, GB
Rolf Niedermeier
  • TU Berlin, DE
and all authors of the abstracts in this report

Cite AsGet BibTex

Arnaud Casteigts, Kitty Meeks, George B. Mertzios, and Rolf Niedermeier. Temporal Graphs: Structure, Algorithms, Applications (Dagstuhl Seminar 21171). In Dagstuhl Reports, Volume 11, Issue 3, pp. 16-46, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
https://doi.org/10.4230/DagRep.11.3.16

Abstract

This report documents the program and the outcomes of Dagstuhl Seminar 121171 "Temporal Graphs: Structure, Algorithms, Applications". The seminar was organized around four core areas: models, concepts, classes; concrete algorithmic problems; distributed aspects; applications. Because of the ongoing pandemic crisis, the seminar had to be held fully online, with talk and open problems sessions focussing on afternoons. Besides 19 contributed talks and small-group discussions, there were lively open-problem sessions, and some of the problems and research directions proposed there are part of this document. Despite strongly missing the usual Dagstuhl atmosphere and personal interaction possibilities, the seminar helped to establish new contacts and to identify new research directions in a thriving research area between (algorithmic) graph theory and network science.

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Graph algorithms
  • Theory of computation → Parameterized complexity and exact algorithms
Keywords
  • algorithm engineering
  • complex network analysis
  • distributed computing
  • models and classes
  • parameterized complexity analysis

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail