Physically-motivated dynamical algorithms for the graph isomorphism problem
From MaRDI portal
Recommendations
- A quantum-walk-inspired adiabatic algorithm for solving graph isomorphism problems
- Attacks on hard instances of graph isomorphism
- Algorithms for the graph isomorphism problem based on graph deregularisation
- GROUP, GRAPHS, ALGORITHMS: THE GRAPH ISOMORPHISM PROBLEM
- Graph algebras and the graph isomorphism problem
Cited in
(13)- Investigation graph isomorphism problem via entanglement entropy in strongly regular graphs
- Graph matching using the interference of continuous-time quantum walks
- On the relation between quantum walks and zeta functions
- Quantum walks, Ihara zeta functions and cospectrality in regular graphs
- A remark on zeta functions of finite graphs via quantum walks
- Two-particle coined-quantum walk with long-range interaction
- Algorithms for the graph isomorphism problem based on graph deregularisation
- A zeta function related to the transition matrix of the discrete-time quantum walk on a graph
- Symmetric squares of graphs
- A classical approach to the graph isomorphism problem using quantum walks
- Directional correlations in quantum walks with two particles
- Entanglement entropy in the ground state of supersymmetric fermion lattice models
- A time-based solution for the graph isomorphism problem
This page was built for publication: Physically-motivated dynamical algorithms for the graph isomorphism problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522549)
