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

DOI10.1016/j.ipl.2023.106433arXiv2201.04799OpenAlexW4386216104MaRDI QIDQ6121418

Max Ward, Loïc Miller, Reynaldo Gil-Pons

Publication date: 26 March 2024

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2201.04799

zbMATH Keywords

computational complexityNP-completenessdirected hypergraphshypernetworks

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Directed hypergraphs: introduction and fundamental algorithms -- a survey
• Linear connectivity problems in directed hypergraphs
• Flows on hypergraphs
• Partially dynamic maintenance of minimum weight hyperpaths
• Directed hypergraphs and applications
• Finding hypernetworks in directed hypergraphs
• Hypernetworks in a directed hypergraph
• The complexity of theorem-proving procedures

This page was built for publication: Finding \((s,d)\)-hypernetworks in F-hypergraphs is NP-hard