complexity

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 arising in directed hypergraphs, and is a foundational step in tackling problems of reachability and redundancy. This …