The Parametrised Complexity of Counting Small Sub-Hypergraphs
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
The Parametrised Complexity of Counting Small Sub-Hypergraphs
arXiv:2506.14081v2 Announce Type: replace Abstract: Subgraph counting is a fundamental and well-studied problem whose computational complexity is well understood. Quite surprisingly, the hypergraph version of subgraph counting has been almost ignored.