Structured Decompositions: Structural and Algorithmic Compositionality

@article{Bumpus2022StructuredDS,
  title={Structured Decompositions: Structural and Algorithmic Compositionality},
  author={Benjamin Merlin Bumpus and Zoltan A. Kocsis and Jade Edenstar Master},
  journal={ArXiv},
  year={2022},
  volume={abs/2207.06091}
}
We introduce structured decompositions: category-theoretic generalizations of many combinatorial invariants – including tree-width, layered tree-width, co-treewidth 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… 

Figures and Tables from this paper

References

SHOWING 1-10 OF 74 REFERENCES

Graph Minors. II. Algorithmic Aspects of Tree-Width

Spined categories: generalizing tree-width beyond graphs

TLDR
This work develops a general theory of categories that admit abstract analogues of both tree decompositions and tree-width and calls these pseudo-chordal completions and the triangulation functor respectively.

Digraph measures: Kelly decompositions, games, and orderings

The canonical directed tree decomposition and its applications to the directed disjoint paths problem

TLDR
This paper constructs directed tree-decompositions of digraphs that distinguish all their tangles of order for any fixed integer k, in polynomial time, the first time to obtain a tractable result for the $k$-disjoint paths problem for generaldigraphs.

Descriptive Complexity, Canonisation, and Definable Graph Structure Theory

TLDR
This ground-breaking book approaches descriptive complexity from the angle of modern structural graph theory, specifically graph minor theory, and develops a ‘definable structure theory’ concerned with the logical definability of graph-theoretic concepts such as tree decompositions and embeddings.

Canonical graph decompositions via coverings

. We present a canonical way to decompose finite graphs into highly connected local parts. The decomposition depends only on an integer parameter whose choice sets the intended degree of locality. The

Digraphs of Bounded Width

TLDR
This chapter separates approaches based on the idea of generalizing the concept of undirected tree-width (or path-width) to digraphs into three categories: tree- width inspired, rank-width inspired and density based.

D-Width: A More Natural Measure for Directed Tree Width

TLDR
A new simple definition for directed tree-width is proposed and a special case of the min-max theorem (duality theorem) relating haven order, bramble number, and tree- width on digraphs is proved.

Local 2-separators

...