directed hypergraphs

Finding (s,d)-Hypernetworks in F-Hypergraphs is NP-Hard

We consider the problem of computing an (s,d)-hypernetwork in an acyclic F-hypergraph. This is a fundamental computational problem …

Reynaldo Gil-Pons, Max Ward, Loïc Miller