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

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

Details and statistics

DOI:

access: open

type: Informal or Other Publication

metadata version: 2022-09-16

a service of  Schloss Dagstuhl - Leibniz Center for Informatics