2020/04/28 by Till Fluschnik, Hendrik Molter, Rolf Niedermeier +2 · 1 citation
Computer Science · #cs.DS #cs.DM
paper · pdf · doi:10.1007/978-3-030-42071-0_6
arxiv created 2020/04/28 · arxiv updated 2020/04/29
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.