Database Paper Browser

Back to papers

Hypergraph Motifs: Concepts, Algorithms, and Discoveries

Summary: Defines hypergraph motifs (h-motifs) and a significance framework based on randomized hypergraphs to capture local connectivity among three connected hyperedges, yielding a domain-distinctive characteristic profile (CP). Introduces MoCHy, a parallel motif-counting family with MoCHy-A+ that achieves up to 25x accuracy and 32x speed over exact and basic approximate methods, enabling cross-domain hypergraph analysis. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
12113
Venue
VLDB
Year
2020
Pagerank
5.4621935e-05
Overall Rank
5,518 | 61.62%
DOI
10.14778/3407790.3407823

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
5,589 Neighborhood-based Hypergraph Core Decomposition 2023 VLDB 5.4216989e-05
10,123 Triangle Counting in Hypergraph Streams: A Complete and Practical Approach 2026 SIGMOD 4.1945683e-05
10,871 Efficient Computation of Hyper-triangles on Hypergraphs 2025 VLDB 4.1945683e-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.

Previous Page 1 / 1 Next

Semantically Similar Papers