Live briefing
Everything about Graph isomorphism
Bijection between the vertex set of two graphs
In graph theory, an isomorphism of graphs G and H is a bijection between the vertex sets of G and H Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Graph isomorphismA 5-minute orientation
- Skim a recent paper: Improving Graph Neural Network Expressivity via Subgraph Isomorphism CountingInfluential work since 2022
- Pick up a classic book: The graph isomorphism problemThe most-reprinted book on the subject
- Read the landmark paper: An Algorithm for Subgraph IsomorphismCited 1,745 times
- Go sideways: Graph canonizationA closely related topic
- Go sideways: Graph isomorphism problemA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
An Algorithm for Subgraph Isomorphism
Practical graph isomorphism, II
The graph isomorphism disease
Random Graph Isomorphism
On convex relaxation of graph isomorphism
The graph isomorphism problem
Graph isomorphism problem
On the Hardness of Graph Isomorphism
🆕 Influential since 2022
Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting
Graph isomorphism-based algorithm for cross-checking chemical and crystallographic descriptions
Malware Detection by Control-Flow Graph Level Representation Learning With Graph Isomorphism Network
Architecture Augmentation for Performance Predictor via Graph Isomorphism
Graph isomorphism U-Net
📚 Books worth reading
The graph isomorphism problemJohannes Köbler, J. Kobler · 1993- 📕Practical algorithms for testing non-isomorphism of graphsG. Madhav Prabhu · 1983
Group-theoretic algorithms and graph isomorphismChristoph M. Hoffmann · 1982- 📕Unimodularity in Randomly Generated GraphsFlorian Sobieczky · 2018
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Graph canonization In graph theory, a branch of mathematics, graph canonization is the problem of finding a canonical form of a given graph G. A canonical form is a labeled…
- Graph isomorphism problem Unsolved problem in computer science Can the graph isomorphism problem be solved in polynomial time? More unsolved problems in computer science The graph…
- Gadget (computer science) In computational complexity theory, a gadget is a subunit of a problem instance that simulates the behavior of one of the fundamental units of a different…
- Graph automorphism In the mathematical field of graph theory, an automorphism of a graph is a form of symmetry in which the graph is mapped onto itself while preserving the…
- Subgraph isomorphism problem In theoretical computer science, the subgraph isomorphism problem is a computational task in which two graphs G {\displaystyle G} and H {\displaystyle…
- Maximum common edge subgraph Given two graphs G {\displaystyle G} and G ′ {\displaystyle G'} , the maximum common edge subgraph problem (or MCES problem) is the problem of finding…
- Graph homomorphism In the mathematical field of graph theory, a graph homomorphism is a mapping between two graphs that respects their structure. More concretely, it is a…
- Colour refinement algorithm In graph theory and theoretical computer science, the colour refinement algorithm also known as the naive vertex classification, or the 1-dimensional version…