McKay's canonical graph labeling algorithm
From MaRDI portal
Recommendations
Cited in
(26)- A general backtrack algorithm for the isomorphism problem of combinatorial objects
- A fast backtrack algorithm for graph isomorphism
- A graph isomorphism algorithm for object recognition
- High-temperature series expansion for spin-1/2 Heisenberg models
- nauty in Macaulay2
- Fast canonical labeling of random subgraphs
- Practical graph isomorphism. II.
- Efficient isomorphism of Miyazaki graphs
- scientific article; zbMATH DE number 3841910 (Why is no real title available?)
- A non-factorial algorithm for canonical numbering of a graph
- Attacks on hard instances of graph isomorphism
- A polynomial representation and a unique code of a simple undirected graph
- Random Graph Isomorphism
- scientific article; zbMATH DE number 1004939 (Why is no real title available?)
- Logic Programming with Graph Automorphism: Integratingnautywith Prolog (Tool Description)
- Representing equivalence problems for combinatorial objects
- scientific article; zbMATH DE number 2102042 (Why is no real title available?)
- scientific article; zbMATH DE number 898423 (Why is no real title available?)
- Error thresholds for arbitrary Pauli noise
- A general comparative study of some aspects of graph isomorphism
- Engineering an efficient canonical labeling tool for large and sparse graphs
- Network Analysis
- Isomorphism testing via polynomial-time graph extensions
- High temperature series expansions of S = 1/2 Heisenberg spin models: algorithm to include the magnetic field with optimized complexity
- Computing equivalence classes among the edges of a graph with applications
- Improved random graph isomorphism
This page was built for publication: McKay's canonical graph labeling algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3620818)
