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 …
reynaldo-gil-pons
•
•
1 min read
Securing Workflows Using Microservices and Metagraphs
Companies such as Netflix increasingly use the cloud to deploy their business processes. Those processes often involve partnerships with other companies, and can be modeled as …
