Live briefing
Everything about Graph canonization
Task in computational graph theory
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 Canon(G) that is isomorphic to G, such that every graph that is isomorphic to G has the same canonical form as G. Thus, from a solution to the graph canonization problem, one could also solve the problem of graph isomorphism: to test whether two graphs G and H are isomorphic, compute their canonical forms Canon(G) and Canon(H), and test whether these two canonical forms are identical. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Graph canonizationA 5-minute orientation
- Skim a recent paper: Canonization of graphs during transistor circuits decompilationInfluential work since 2022
- Pick up a classic book: Mathematical structures for computer scienceThe most-reprinted book on the subject
- Read the landmark paper: Detection of Network Motif Based on a Novel Graph Canonization Algorithm from Transcriptional Regulation NetworksCited 19 times
- Go sideways: Graph isomorphism problemA closely related topic
- Go sideways: Graph isomorphismA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Detection of Network Motif Based on a Novel Graph Canonization Algorithm from Transcriptional Regulation Networks
A Generic Framework for Engineering Graph Canonization Algorithms
A graph canonization method for pattern recognition
Canonization of a random circulant graph by counting walks
The Parallel Complexity of Graph Canonization Under Abelian Group Action
Charlemagne: Iconography and Canonization
Charlemagne: Iconography and Canonization
Charlemagne: Iconography and canonization
🆕 Influential since 2022
📚 Books worth reading
Mathematical structures for computer scienceJudith L. Gersting · 1982
Winsor McCayWinsor McCay · 2003
Perturbation theory for linear operatorsTosio Katō · 1966
Principles of compiler designAlfred V. Aho, Jeffrey D. Ullman · 1977
Drupal 7 bibleRic Shreves · 2011
Optimal Analysis of Structures by Concepts of Symmetry and RegularityAli Kaveh · 2013
Advances in Knowledge Discovery and Data MiningJian Pei · 2013
The tao of statisticsDana K. Keller · 2012
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- 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…
- Graph isomorphism In graph theory, an isomorphism of graphs G and H is a bijection between the vertex sets of G and H f:V(G)→V(H) such that any two vertices u and v of G…
- 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…
- László Babai László "Laci" Babai (born July 20, 1950, in Budapest) is a Hungarian-American professor of computer science and mathematics at the University of Chicago…
- Eugene M. Luks Eugene Michael Luks (born circa 1940) is an American mathematician and computer scientist, a professor emeritus of computer and information science at…
- 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…
- Chromatic polynomial The chromatic polynomial is a graph polynomial studied in algebraic graph theory, a branch of mathematics. It counts the number of graph colorings as a…
- Independent set (graph theory) In graph theory, an independent set, stable set, coclique or anticlique is a set of vertices in a graph, no two of which are adjacent. That is, it is a…