As Time Goes By: Reflections on Treewidth for Temporal Graphs

04/28/2020
by   Till Fluschnik, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

11/25/2019

Graph isomorphism in quasipolynomial time parameterized by treewidth

We extend Babai's quasipolynomial-time graph isomorphism test (STOC 2016...
01/21/2019

An Experimental Study of the Treewidth of Real-World Graph Data (Extended Version)

Treewidth is a parameter that measures how tree-like a relational instan...
12/14/2021

Edge-trewidth: Algorithmic and combinatorial properties

We introduce the graph theoretical parameter of edge treewidth. This par...
10/11/2019

Analysis of Co-Occurrence Patterns in Data through Modular and Clan Decompositions of Gaifman Graphs

Our team has recently demonstrated that clan decompositions of generaliz...
06/30/2022

Slim Tree-Cut Width

Tree-cut width is a parameter that has been introduced as an attempt to ...
09/04/2018

Treewidth of display graphs: bounds, brambles and applications

Phylogenetic trees and networks are leaf-labelled graphs used to model e...
06/08/2021

On the nonexistence of FO-continuous path and tree-decompositions

Bojanczyk and Pilipczuk showed in their celebrated article "Definability...