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

Arnaud Casteigts, Kitty Meeks, George B. Mertzios, Rolf Niedermeier
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
more » ... -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.
doi:10.4230/dagrep.11.3.16 fatcat:cpmzjwdmebabvixxc7a6vpcphe