Back to Search Start Over

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

Authors :
Arnaud Casteigts and Kitty Meeks and George B. Mertzios and Rolf Niedermeier
Casteigts, Arnaud
Meeks, Kitty
Mertzios, George B.
Niedermeier, Rolf
Arnaud Casteigts and Kitty Meeks and George B. Mertzios and Rolf Niedermeier
Casteigts, Arnaud
Meeks, Kitty
Mertzios, George B.
Niedermeier, Rolf
Publication Year :
2021

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.

Details

Database :
OAIster
Notes :
application/pdf, English
Publication Type :
Electronic Resource
Accession number :
edsoai.on1275360208
Document Type :
Electronic Resource
Full Text :
https://doi.org/10.4230.DagRep.11.3.16