MapEff: An Effective Graph Isomorphism Agorithm Based on the Discrete-Time Quantum Walk
Graph isomorphism is to determine whether two graphs have the same topological structure. It plays a significant role in areas of image matching, biochemistry, and information retrieval. Quantum walk, as a novel quantum computation model, has been employed to isomorphic mapping detection to optimize...
Main Authors: | Kai Liu, Yi Zhang, Kai Lu, Xiaoping Wang, Xin Wang, Guojing Tian |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2019-06-01
|
Series: | Entropy |
Subjects: | |
Online Access: | https://www.mdpi.com/1099-4300/21/6/569 |
Similar Items
-
Marking Vertices to Find Graph Isomorphism Mapping Based on Continuous-Time Quantum Walk
by: Xin Wang, et al.
Published: (2018-08-01) -
An Efficient Subgraph Isomorphism Solver for Large Graphs
by: Zubair Ali Ansari, et al.
Published: (2021-01-01) -
Quantum and non-signalling graph isomorphisms
by: Atserias, Albert, et al.
Published: (2020) -
Homomorphism and Isomorphism of Neutrosophic Over Topologized Graphs
by: G. Muthumari, et al.
Published: (2023-01-01) -
Relaxations of graph isomorphism
by: Mančinska, Laura, et al.
Published: (2018)