DeepAI AI Chat
Log In Sign Up

Structured Decompositions: Structural and Algorithmic Compositionality

by   Benjamin Merlin Bumpus, et al.

We introduce structured decompositions: category-theoretic generalizations of many combinatorial invariants – including tree-width, layered tree-width, co-tree-width and graph decomposition width – which have played a central role in the study of structural and algorithmic compositionality in both graph theory and parameterized complexity. Structured decompositions allow us to generalize combinatorial invariants to new settings (for example decompositions of matroids) in which they describe algorithmically useful structural compositionality. As an application of our theory we prove an algorithmic meta theorem for the Sub_P-composition problem which, when instantiated in the category of graphs, yields compositional algorithms for NP-hard problems such as: Maximum Bipartite Subgraph, Maximum Planar Subgraph and Longest Path.


page 6

page 7

page 29

page 32

page 39

page 40


Lean tree-cut decompositions: obstructions and algorithms

The notion of tree-cut width has been introduced by Wollan [The structur...

Compositional Algorithms on Compositional Data: Deciding Sheaves on Presheaves

Algorithmicists are well-aware that fast dynamic programming algorithms ...

A Structural Approach to Tree Decompositions of Knots and Spatial Graphs

Knots are commonly represented and manipulated via diagrams, which are d...

The Algorithmic Complexity of Tree-Clique Width

Tree-width has been proven to be a useful parameter to design fast and e...

Spined categories: generalizing tree-width beyond graphs

We develop a general theory of categories that admit a functorial invari...

Practical Access to Dynamic Programming on Tree Decompositions

Parameterized complexity theory has lead to a wide range of algorithmic ...

Comonadic semantics for guarded fragments

In previous work, Abramsky, Dawar and Wang (LiCS 2017) and Abramsky and ...