Color coding for k-hypergraphlet counting is quadratically hard in general but runs in 2^{O(k)} · (2^β |V| + α^k |E| + α² β ||H||) time on (α,β)-nice hypergraphs common in practice.
The shape of collaborations.EPJ Data Science, 6(1):18, 2017
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Counting HyperGraphlets via Color Coding: a Quadratic Barrier and How to Break It
Color coding for k-hypergraphlet counting is quadratically hard in general but runs in 2^{O(k)} · (2^β |V| + α^k |E| + α² β ||H||) time on (α,β)-nice hypergraphs common in practice.