Finding \((s,d)\)-hypernetworks in F-hypergraphs is NP-hard (Q6121418)
From MaRDI portal
scientific article; zbMATH DE number 7824700
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding \((s,d)\)-hypernetworks in F-hypergraphs is NP-hard |
scientific article; zbMATH DE number 7824700 |
Statements
Finding \((s,d)\)-hypernetworks in F-hypergraphs is NP-hard (English)
0 references
26 March 2024
0 references
directed hypergraphs
0 references
hypernetworks
0 references
computational complexity
0 references
NP-completeness
0 references
