
PageRank algorithm for Directed Hypergraph
During the last two decades, we easilly see that the World Wide Web's li...
read it

Even Circuits in Oriented Matroids
In this paper we generalise the even directed cycle problem, which asks ...
read it

Constant congestion brambles in directed graphs
The Directed Grid Theorem, stating that there is a function f such that ...
read it

Parametrised Algorithms for Directed Modular Width
Many wellknown NPhard algorithmic problems on directed graphs resist e...
read it

A Hamilton Cycle in the kSided Pancake Network
We present a Hamilton cycle in the ksided pancake network and four comb...
read it

Directed hypergraph neural network
To deal with irregular data structure, graph convolution neural networks...
read it

Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs
A connected graph G is called matching covered if every edge of G is con...
read it
A Note on Directed Treewidth
We characterise digraphs of directed treewidth one in terms of forbidden butterfly minors. Moreover, we show that there is a linear relation between the hypertreewidth 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
Comments
There are no comments yet.