4 citations · 9 across the 15 of their papers we have counts for
3 papers · 1 filter
Lassos: Pushing Tree Decompositions Forward Along Homomorphisms
Benjamin Merlin Bumpus, James Fairbanks, Will J. Turner
It is folklore that tree-width is monotone under taking subgraphs (i.e. injective graph homomorphisms) and contractions (certain kinds of surjective graph homomorphisms). However,…
Spined categories: generalizing tree-width beyond graphs
Benjamin Merlin Bumpus, Zoltan A. Kocsis
Tree-width is an invaluable tool for computational problems on graphs. But often one would like to compute on other kinds of objects (e.g. decorated graphs or even algebraic struct…
Directed branch-width: A directed analogue of tree-width
Benjamin Merlin Bumpus, Kitty Meeks, William Pettersson
Gurski and Wanke showed that a graph class C has bounded tree-width if and only if its associated class of directed line graphs has bounded clique-width. Inevitably -- asking wheth…