Algorithms for the graph isomorphism problem based on graph deregularisation
From MaRDI portal
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Recommendations
- Graph algebras and the graph isomorphism problem
- Physically-motivated dynamical algorithms for the graph isomorphism problem
- New invariants for the graph isomorphism problem
- SPECTRUM BASED TECHNIQUES FOR GRAPH ISOMORPHISM
- Isomorphism testing algorithm for graphs: Incidence degree sequence method and applications
Cited in
(12)- scientific article; zbMATH DE number 4002140 (Why is no real title available?)
- scientific article; zbMATH DE number 5525608 (Why is no real title available?)
- An algorithm for optimal isomorphism between two random graphs
- ScrewBox: a randomized certifying graph-non-isomorphism algorithm
- New invariants for the graph isomorphism problem
- Physically-motivated dynamical algorithms for the graph isomorphism problem
- An algorithm for determining isomorphism using lexicographic sorting and the matrix inverse
- SPECTRUM BASED TECHNIQUES FOR GRAPH ISOMORPHISM
- scientific article; zbMATH DE number 3904629 (Why is no real title available?)
- scientific article; zbMATH DE number 7145105 (Why is no real title available?)
- scientific article; zbMATH DE number 7403940 (Why is no real title available?)
- A spectral assignment approach for the graph isomorphism problem
This page was built for publication: Algorithms for the graph isomorphism problem based on graph deregularisation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146186)
