### Benjamin Bumpus, Directed branch-width: A directed analogue of tree-width

Zoom ID: 934 3222 0374 (ibsdimag)Many problems that are NP-hard in general become tractable on `structurally recursive’ graph classes. For example, consider classes of bounded tree- or clique-width. Since the 1990s, many directed analogues of tree-width have been proposed. However, many natural problems (e.g. directed HamiltonPath and MaxCut) remain intractable on such digraph classes of `bounded width’. In this talk, …