Live briefing
Everything about Graph embedding
Embedding a graph in a topological space, often Euclidean
In topological graph theory, an embedding of a graph on a surface is a representation of on in which points of are associated with vertices and simple arcs are associated with edges in such a way that:the endpoints of the arc associated with an edge are the points associated with the end vertices of no arcs include points associated with other vertices, two arcs never intersect at a point which is interior to either of the arcs. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Graph embeddingA 5-minute orientation
- Skim a recent paper: Multi-omics single-cell data integration and regulatory inference with graph-linked embeddingInfluential work since 2022
- Pick up a classic book: Graphs on surfaces and their applicationsThe most-reprinted book on the subject
- Read the landmark paper: Reversed graph embedding resolves complex single-cell trajectoriesCited 5,013 times
- Go sideways: Combinatorial mapA closely related topic
- Go sideways: Planar graphA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
Reversed graph embedding resolves complex single-cell trajectories
Graph Embedding and Extensions: A General Framework for Dimensionality Reduction
Knowledge Graph Embedding by Translating on Hyperplanes
Learning Entity and Relation Embeddings for Knowledge Graph Completion
Knowledge Graph Embedding: A Survey of Approaches and Applications
Convolutional 2D Knowledge Graph Embeddings
A Comprehensive Survey of Graph Embedding: Problems, Techniques, and Applications
🆕 Influential since 2022
Multi-omics single-cell data integration and regulatory inference with graph-linked embedding
A Survey on Heterogeneous Graph Embedding: Methods, Techniques, Applications and Sources
Learning Knowledge Graph Embedding With Heterogeneous Relation Attention Networks
Embedding Graph Auto-Encoder for Graph Clustering
Graph Clustering via Variational Graph Embedding
📚 Books worth reading
Graphs on surfaces and their applicationsS. K. Lando, Sergei K. Lando · 2003- 📕Graph embedding techniques for bounding condition numbers of incomplete factor preconditionersStephen Guattery · 1997
Embeddability in graphsLiu, Yanpei · 1995
Canonical simplification of finite objects, well quasi-ordered by tree embeddingBrown, Thomas C. · 1979
Scale-isometric polytopal graphs in hypercubes and cubic latticesMichel M. Deza · 2004
Geometry of cuts and metricsMichel M. Deza · 1997
Geometry of Cuts and Metrics
Algorithms and CombinatoricsMonique Laurent · 2009
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Combinatorial map A combinatorial map is a combinatorial representation of a graph on an orientable surface. A combinatorial map may also be called a combinatorial embedding…
- Planar graph In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect…
- Tutte embedding In graph drawing and geometric graph theory, a Tutte embedding or barycentric embedding of a simple, 3-vertex-connected, planar graph is a crossing-free…
- Book embedding In graph theory, a book embedding is a generalization of planar embedding of a graph to embeddings in a book, a collection of half-planes all having the…
- Upward planar drawing In graph drawing, an upward planar drawing of a directed acyclic graph is an embedding of the graph into the Euclidean plane, in which the edges are represented…
- Dual graph In the mathematical discipline of graph theory, the dual graph of a planar graph G is a graph that has a vertex for each face of G. The dual graph has…
- Matroid parity problem In combinatorial optimization, the matroid parity problem is a problem of finding the largest independent set of paired elements in a matroid, a structure…
- Circle packing theorem The circle packing theorem (also known as the Koebe–Andreev–Thurston theorem) describes the possible patterns of tangent circles among non-overlapping…