Cargando…
Marking Vertices to Find Graph Isomorphism Mapping Based on Continuous-Time Quantum Walk
The isomorphism problem involves judging whether two graphs are topologically the same and producing structure-preserving isomorphism mapping. It is widely used in various areas. Diverse algorithms have been proposed to solve this problem in polynomial time, with the help of quantum walks. Some of t...
| Autores principales: | , , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
MDPI
2018
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7513114/ https://www.ncbi.nlm.nih.gov/pubmed/33265675 http://dx.doi.org/10.3390/e20080586 |