Directed hypergraphs: Introduction and fundamental algorithms-A survey

Just as ordinary hypergraphs are a generalization of graphs, directed hypergraphs (DH) are a natural generalization of digraphs. A DH consists of a set of vertices V and a set of hyperarcs H, where a hyperarc is a pair < S, v >, S non empty subset of V and V is an element of V. DHs have a variety of applications: they have been used to represent functional dependency in databases, Horn formulae in propositional logic, and-or graphs, context free grammars etc. In the paper, after providing a brief historical introduction on the notion of DH and some relevant applications, various problems regarding DHs are surveyed and analyzed. In particular we consider the complexity of the reachability problem (together with its application in the related satisfiability problem for Horn CNF formulae) and the computation of transitive closure and transitive reduction of directed hypergraphs (together with its application to the computation of minimum coverings for a set of functional dependencies). Finally a short introduction to the problem of computing shortest hyperpaths in directed hypergraphs is provided. (C) 2016 Elsevier B.V. All rights reserved.