As Time Goes By: Reflections on Treewidth for Temporal Graphs
Data Structures and Algorithms
2020-04-29 v1 Discrete Mathematics
Abstract
Treewidth is arguably the most important structural graph parameter leading to algorithmically beneficial graph decompositions. Triggered by a strongly growing interest in temporal networks (graphs where edge sets change over time), we discuss fresh algorithmic views on temporal tree decompositions and temporal treewidth. We review and explain some of the recent work together with some encountered pitfalls, and we point out challenges for future research.
Keywords
Cite
@article{arxiv.2004.13491,
title = {As Time Goes By: Reflections on Treewidth for Temporal Graphs},
author = {Till Fluschnik and Hendrik Molter and Rolf Niedermeier and Malte Renken and Philipp Zschoche},
journal= {arXiv preprint arXiv:2004.13491},
year = {2020}
}