"Finding (s,d)-hypernetworks in F-hypergraphs is NP-hard."

Reynaldo Gil Pons, Max Ward, Loïc Miller (2024)

Details and statistics

DOI: 10.1016/J.IPL.2023.106433

access: closed

type: Journal Article

metadata version: 2024-01-24

a service of  Schloss Dagstuhl - Leibniz Center for Informatics