Correlation between the continuous-time quantum walk and cliques in graphs and its application
From MaRDI portal
(Redirected from Publication:5003363)
Recommendations
- Graph matching using the interference of continuous-time quantum walks
- An enhanced classical approach to graph isomorphism using continuous-time quantum walk
- Continuous-time quantum walks on strongly regular graphs with loops and its application to spatial search for multiple marked vertices
- On the relationship between continuous- and discrete-time quantum walk
- QUANTUM WALKS ON GENERAL GRAPHS
Cites work
- A fast algorithm for the maximum clique problem
- A review on algorithms for maximum clique problems
- An exact algorithm for the maximum clique problem
- scientific article; zbMATH DE number 5320186 (Why is no real title available?)
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- Quantum simulations of classical random walks and undirected graph connectivity
- Reducibility among combinatorial problems
Cited in
(4)
This page was built for publication: Correlation between the continuous-time quantum walk and cliques in graphs and its application
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5003363)