s,d)-hypernetworks in F-hypergraphs is NP-hard.">s,d)-hypernetworks in F-hypergraphs is NP-hard., dblp, computer science, bibliography, knowledge graph, author, editor, publication, conference, journal, book, thesis, database, collection, open data, bibtex">
[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

"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