Hypergraph Motifs: Concepts, Algorithms, and Discoveries
Summary: Introduces three-hyperedge hypergraph motifs and characteristic profiles, revealing domain-specific local structure and enabling cross-size comparison. MoCHy provides parallel exact/approximate counting, with MoCHy-A+ improving speed and accuracy substantially. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Geon Lee (Korea Advanced Institute of Science and Technology)
- 2. Jihoon Ko (Korea Advanced Institute of Science and Technology)
- 3. Kijung Shin (Korea Advanced Institute of Science and Technology)
BibTeX Citation
@article{lee_vldb20,
title = {{Hypergraph Motifs: Concepts, Algorithms, and Discoveries}},
author = {Lee, Geon and Ko, Jihoon and Shin, Kijung},
journal = {PVLDB},
series = {{VLDB} '20},
volume = {13},
number = {11},
pages = {2256--2269},
doi = {10.14778/3407790.3407823},
url = {https://doi.org/10.14778/3407790.3407823},
year = {2020}
}Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,314 | Neighborhood-based Hypergraph Core Decomposition | 2023 | VLDB | 6.6695257e-05 |
| 10,603 | Triangle Counting in Hypergraph Streams: A Complete and Practical Approach | 2026 | SIGMOD | 4.9793485e-05 |
| 10,770 | Counting HyperGraphlets via Color Coding: a Quadratic Barrier and How to Break It | 2026 | VLDB | 4.9793485e-05 |
| 10,806 | Efficient Hyper-truss Decomposition over Hypergraphs | 2026 | VLDB | 4.9793485e-05 |
| 11,446 | Efficient Computation of Hyper-triangles on Hypergraphs | 2025 | VLDB | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 600 | Massive Graph Triangulation | 2013 | SIGMOD | 0.00015740352 |
| 1,940 | A General Framework for Estimating Graphlet Statistics via Random Walk | 2017 | VLDB | 9.3302142e-05 |
| 2,985 | Motivo: fast motif counting via succinct color coding and adaptive sampling | 2019 | VLDB | 7.7808773e-05 |
| 3,380 | OPT: A New Framework for Overlapped and Parallel Triangulation in Large-scale Graphs | 2014 | SIGMOD | 7.3567664e-05 |
| 4,285 | TurboGraph++: A Scalable and Fast Graph Analytics System | 2018 | SIGMOD | 6.688615e-05 |
| 4,487 | Approximately Counting Triangles in Large Graph Streams Including Edge Duplicates with a Fixed Memory Usage | 2018 | VLDB | 6.5786974e-05 |
| 4,575 | On Sampling from Massive Graph Streams | 2017 | VLDB | 6.5256176e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,314 | Neighborhood-based Hypergraph Core Decomposition | 2023 | VLDB |
| 2 | 2,985 | Motivo: fast motif counting via succinct color coding and adaptive sampling | 2019 | VLDB |
| 3 | 8,359 | Efficient and Effective Attributed Hypergraph Clustering via K-Nearest Neighbor Augmentation | 2023 | SIGMOD |
| 4 | 10,806 | Efficient Hyper-truss Decomposition over Hypergraphs | 2026 | VLDB |
| 5 | 9,474 | Accelerating Core Decomposition in Billion-Scale Hypergraphs | 2025 | SIGMOD |
| 6 | 6,082 | On Graph Representation for Attributed Hypergraph Clustering | 2025 | SIGMOD |
| 7 | 8,178 | Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks | 2024 | VLDB |
| 8 | 11,996 | On Analyzing Graphs with Motif-Paths | 2021 | VLDB |
| 9 | 11,726 | Modularity-based Hypergraph Clustering: Random Hypergraph Model, Hyperedge-cluster Relation, and Computation | 2023 | SIGMOD |
| 10 | 11,446 | Efficient Computation of Hyper-triangles on Hypergraphs | 2025 | VLDB |