Live briefing
Everything about E-graph
Graph data structure
In computer science, an e-graph is a data structure that stores an equivalence relation over terms of some language. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: E-graphA 5-minute orientation
- Skim a recent paper: E(3)-equivariant graph neural networks for data-efficient and accurate interatomic potentialsInfluential work since 2022
- Pick up a classic book: Algorithms in C++The most-reprinted book on the subject
- Read the landmark paper: Graph-based genome alignment and genotyping with HISAT2 and HISAT-genotypeCited 15,700 times
- Go sideways: Klein polyhedronA closely related topic
- Go sideways: Lindström–Gessel–Viennot lemmaA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Graph-based genome alignment and genotyping with HISAT2 and HISAT-genotype
Complex brain networks: graph theoretical analysis of structural and functional systems
A Comprehensive Survey on Graph Neural Networks
MEGAHIT: an ultra-fast single-node solution for large and complex metagenomics assembly via succinct de Bruijn graph
The Graph Neural Network Model
Patterns in Hydrogen Bonding: Functionality and Graph Set Analysis in Crystals
Graph-Based Algorithms for Boolean Function Manipulation
Fast approximate energy minimization via graph cuts
🆕 Influential since 2022
E(3)-equivariant graph neural networks for data-efficient and accurate interatomic potentials
Graph neural network for traffic forecasting: A survey
Graph Neural Networks in Recommender Systems: A Survey
A universal graph deep learning interatomic potential for the periodic table
Graph neural networks for materials science and chemistry
đź“š Books worth reading
Algorithms in C++Robert Sedgewick · 1990
Networks, crowds, and marketsDavid Easley · 2010
Graph algorithmsShimon Even · 1979
Data structuresA. T. Berztiss · 1975
Wave PhenomenaDudley H. Towne · 1967- 📕Properties of planar graphs with uniform vertex and face structureJoseph Malkevitch · 1970
Introduction a l'algorithmiqueThomas H. Cormen · 2002- 📕Polytopes and Discrete GeometryGabriel Cunningham, Mark Mixer · 2021
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Klein polyhedron In the geometry of numbers, the Klein polyhedron, named after Felix Klein, is used to generalize the concept of simple continued fractions to higher dimensions…
- Lindström–Gessel–Viennot lemma In mathematics, the Lindström–Gessel–Viennot lemma provides a way to count the tuples of non-intersecting lattice paths, or, more generally, paths on a…
- Flag algebra Flag algebras are an important computational tool in the field of graph theory which have a wide range of applications in homomorphism density and related…
- Quantum relative entropy In quantum information theory, quantum relative entropy is a measure of distinguishability between two quantum states. It is the quantum mechanical analog…
- Bregman–Minc inequality In discrete mathematics, the Bregman–Minc inequality, or Bregman's theorem, allows one to estimate the permanent of a binary matrix via its row or column…
- Pfaffian In mathematics, the determinant of an m-by-m skew-symmetric matrix can always be written as the square of a polynomial in the matrix entries, a polynomial…
- Normal basis In mathematics, specifically the algebraic theory of fields, a normal basis is a special kind of basis for Galois extensions of finite degree, characterised…
- Noncommutative signal-flow graph In automata theory and control theory, branches of mathematics, theoretical computer science and systems engineering, a noncommutative signal-flow graph…