Live briefing
Everything about Hypergraph
Generalization of graph theory
In mathematics, a hypergraph is a generalization of a graph in which an edge can join any number of vertices. In contrast, in an ordinary graph, an edge connects exactly two vertices. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: HypergraphA 5-minute orientation
- Skim a recent paper: A Survey on Hypergraph Representation LearningInfluential work since 2022
- Pick up a classic book: Graphs and hypergraphsThe most-reprinted book on the subject
- Read the landmark paper: Hypergraph Neural NetworksCited 1,585 times
- Go sideways: Balanced hypergraphA closely related topic
- Go sideways: Matching in hypergraphsA closely related topic
📖 Definitions
Noun A generalization of a graph, in which edges can connect any number of vertices.
🏆 Landmark papers (most cited)
Hypergraph Neural Networks
Hypergraph convolution and hypergraph attention
HGNN + : General Hypergraph Neural Networks
3-D Object Retrieval and Recognition With Hypergraph Analysis
Multilevel hypergraph partitioning: applications in VLSI domain
Self-Supervised Hypergraph Convolutional Networks for Session-based Recommendation
Hyper-YOLO: When Visual Object Detection Meets Hypergraph Computation
Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication
🆕 Influential since 2022
A Survey on Hypergraph Representation Learning
Model-Assisted Multi-source Fusion Hypergraph Convolutional Neural Networks for intelligent few-shot fault diagnosis to Electro-Hydrostatic Actuator
High-Quality Hypergraph Partitioning
Temporal multi-resolution hypergraph attention network for remaining useful life prediction of rolling bearings
AMHMDA: attention aware multi-view similarity networks and hypergraph learning for miRNA–disease associations identification
📚 Books worth reading
Graphs and hypergraphsClaude Berge · 1973- 📕Erds-Ko-Rado TheoremsC. D. Godsil, Karen Meagher · 2015
Graph based representations in pattern recognitionJean-Michel Jolion · 1998
Graphes et hypergraphesClaude Berge · 1970- 📕Introduction à la théorie des hypergraphesClaude Berge · 1973
Fuzzy graphs and fuzzy hypergraphsJohn N. Mordeson, Premchand S. Nair · 2000
Advances in Imaging and Electron Physics, Volume 131 (Advances in Imaging and Electron Physics)Peter W. Hawkes · 2004
HypergraphsClaude Berge · 1989
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Balanced hypergraph In graph theory, a balanced hypergraph is a hypergraph that has several properties analogous to that of a bipartite graph. Balanced hypergraphs were introduced…
- Matching in hypergraphs In graph theory, a matching in a hypergraph is a set of hyperedges, in which every two hyperedges are disjoint. It is an extension of the notion of matching…
- Hall-type theorems for hypergraphs In the mathematical field of graph theory, Hall-type theorems for hypergraphs are several generalizations of Hall's marriage theorem from graphs to hypergraphs…
- Bipartite hypergraph In graph theory, the term bipartite hypergraph describes several related classes of hypergraphs, all of which are natural generalizations of a bipartite…
- Glossary of graph theory Look up Appendix:Glossary of graph theory in Wiktionary, the free dictionary. This is a glossary of graph theory. Graph theory is the study of graphs,…
- Bipartite graph In the mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets…
- Vertex cover in hypergraphs In graph theory, a vertex cover in a hypergraph is a set of vertices, such that every hyperedge of the hypergraph contains at least one vertex of that…
- Clique complex Clique complexes, independence complexes, flag complexes, Whitney complexes and conformal hypergraphs are closely related mathematical objects in graph…