… the idea to hypergraphs. Our idea is to transform a hypergraph into an equivalent directed
line graph that accurately captures the multiple relationship exhibited by the hypergraph. The …

… , Directed hypergraphs and applications, Discrete Applied Mathematics 42 (1993) 177-20 1,
We deal with directed hypergraphs as a … line stop of line 5 depends on the subset of lines Li …

… addressed in this paper are B-hypergraphs. We refer the interested reader to the work of …
variants of directed hypergraphs is presented. A definition of directed hypergraph closer to the …

… directed hypergraphs with a minimum diameter. This method is an adaptation of the partial
line digraph technique [7] to hyperdigraphs and can be seen as a generalization of the line …

… hypergraphs, but no complexity bound is provided. Here we point out that stratified hypergraphs
actually coincide with acyclic hypergraphs, … At that point (line 2) we process each arc (u, v…

… from the directed hypergraph (left) to the directed line graph (… a directed line graph of a given
directed hypergraph ⃗H: the … [1993], we define a directed hypergraph ⃗H as a hypergraph …

… On the other hand, we show that, for k-directed hypergraphs (hypergraphs in which the number
… existence problem is NEXP-complete when the hypergraphs are succinctly represented. …

… a hypergraph which can precisely capture hypergraph structural information, we consider
transforming a hypergraph into a directed line … or nonuniform hypergraphs characteristics and …

… If we let ~1 be the (necessarily constant) line sums of X, and o the line sums of Y, then G is
called a normalized (a, w)-graph [ 131. The columns of Y indicate cliques of order o on G, and …

… H with n nodes and m hyperarcs, there exists a data structure which allows to check on line
in … Other results concerning on-line algorithms for directed hypergraphs, together with their …