A Note on Directed Treewidth

10/04/2019
by   Sebastian Wiederrecht, et al.
0

We characterise digraphs of directed treewidth one in terms of forbidden butterfly minors. Moreover, we show that there is a linear relation between the hypertree-width of the dual of the cycle hypergraph of D, i. e. the hypergraph with vertices V (D) where every hyperedge corresponds to a directed cycle in D, and the directed treewidth of D. Based on this we show that a digraph has directed treewidth one if and only if its cycle hypergraph is a hypertree.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

08/29/2019

PageRank algorithm for Directed Hypergraph

During the last two decades, we easilly see that the World Wide Web's li...
11/29/2021

Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth

We study the minimum size f of a feedback vertex set in directed and und...
10/13/2021

Myerson value of directed hypergraphs

In this paper, we consider a directed hypergraph as cooperative network,...
10/18/2020

Even Circuits in Oriented Matroids

In this paper we generalise the even directed cycle problem, which asks ...
11/08/2021

Simple odd β-cycle inequalities for binary polynomial optimization

We consider the multilinear polytope which arises naturally in binary po...
03/15/2021

Constant congestion brambles in directed graphs

The Directed Grid Theorem, stating that there is a function f such that ...
06/24/2020

Turbocharging Treewidth-Bounded Bayesian Network Structure Learning

We present a new approach for learning the structure of a treewidth-boun...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.