Counting HyperGraphlets via Color Coding: a Quadratic Barrier and How to Break It
Summary: Color coding for k-hypergraphlet counting faces a quadratic-time barrier under OVC. Exploiting empirically prevalent (α,β)-nice structure breaks it with output-sensitive complexity and enables efficient uniform colorful-hypergraphlet sampling. (summarized by gpt-5.6-luna on Aug 17 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Marco Bressan (University of Milan)
- 2. Stefano Clemente (University of Milan)
- 3. Giacomo Fumagalli (University of Milan)
BibTeX Citation
@article{bressan_vldb26,
title = {{Counting HyperGraphlets via Color Coding: a Quadratic Barrier and How to Break It}},
author = {Bressan, Marco and Clemente, Stefano and Fumagalli, Giacomo},
journal = {PVLDB},
series = {{VLDB} '26},
volume = {19},
number = {9},
pages = {2073--2085},
doi = {10.14778/3819518.3819535},
url = {https://doi.org/10.14778/3819518.3819535},
year = {2026}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,985 | Motivo: fast motif counting via succinct color coding and adaptive sampling | 2019 | VLDB | 7.7808773e-05 |
| 3,539 | Hypergraph Motifs: Concepts, Algorithms, and Discoveries | 2020 | VLDB | 7.2173698e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 7,775 | Efficient k-Clique Count Estimation with Accuracy Guarantee | 2024 | VLDB |
| 2 | 2,743 | Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB |
| 3 | 8,772 | A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition | 2022 | VLDB |
| 4 | 2,325 | (p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB |
| 5 | 10,806 | Efficient Hyper-truss Decomposition over Hypergraphs | 2026 | VLDB |
| 6 | 4,224 | Efficient Biclique Counting in Large Bipartite Graphs | 2023 | SIGMOD |
| 7 | 5,781 | Effective and Efficient Dynamic Graph Coloring | 2018 | VLDB |
| 8 | 4,044 | Efficient Bi-triangle Counting for Large Bipartite Networks | 2021 | VLDB |
| 9 | 11,045 | Scalable Approximate Biclique Counting over Large Bipartite Graphs | 2026 | VLDB |
| 10 | 11,446 | Efficient Computation of Hyper-triangles on Hypergraphs | 2025 | VLDB |