Jul 2026
The Fine-Grained Complexity of Counting Hypergraph Motifs
This work proves that such an algorithm exists exactly for the degenerate Venn diagrams, namely those that force one of the three hyperedges to be fully contained in another, and shows when this can be improved to FPT-near-linear time.
M. Krishnakumar, Marc Roth
· arXiv.org · 0 citations