As Time Goes By: Reflections on Treewidth for Temporal Graphs

Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, Philipp Zschoche

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

3 Scopus citations

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer
Pages49-77
Number of pages29
DOIs
StatePublished - 1 Jan 2020
Externally publishedYes

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12160 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Keywords

  • Link stream
  • Monadic second-order logic (MSO)
  • NP-hardness
  • Network science
  • Parameterized complexity
  • Time-evolving network
  • Tree decomposition

Fingerprint

Dive into the research topics of 'As Time Goes By: Reflections on Treewidth for Temporal Graphs'. Together they form a unique fingerprint.

Cite this