Strongly Equivalent Directed Hypergraphs

Various concepts of equivalence among graphs and among hypergraphs have been studied by several authors. In this paper the concept of strong equivalence between directed hypergraphs, based on the notion of kernel, is considered and its properties are analyzed. The computational complexity of testing strong equivalence and of determining a minimal strongly equivalent hypergraph is examined and algorithms which solve such problems in polynomial time are provided.