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

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

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