d)-hypernetworks in F-hypergraphs is NP-hard

Reynaldo Gil Pons, Max Ward 0001, Loïc Miller. d)-hypernetworks in F-hypergraphs is NP-hard. Inf. Process. Lett., 184:106433, February 2024. [doi]

Abstract

Abstract is missing.