MapEff: An Effective Graph Isomorphism Agorithm Based on the Discrete-Time Quantum Walk
AbstractGraph 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 the time complexity compared with a classical computation model. However, these quantum-inspired algorithms do not perform well—and even cease to work—for graphs with inherent symmetry, such as regular graphs. By analyzing the impacts of graphs symmetry on isomorphism detection, we proposed an effective graph isomorphism algorithm (MapEff) based on the discrete-time quantum walk (DTQW) to improve the accuracy of isomorphic mapping detection, especially for regular graphs. With the help of auxiliary edges, this algorithm can distinguish the symmetric nodes efficiently and, thus, deduct the qualified isomorphic mapping by rounds of selections. The experiments tested on 1585 pairs of graphs demonstrated that our algorithm has a better performance compared with other state-of-the-art algorithms. View Full-Text
Share & Cite This Article
Liu, K.; Zhang, Y.; Lu, K.; Wang, X.; Wang, X.; Tian, G. MapEff: An Effective Graph Isomorphism Agorithm Based on the Discrete-Time Quantum Walk. Entropy 2019, 21, 569.
Liu K, Zhang Y, Lu K, Wang X, Wang X, Tian G. MapEff: An Effective Graph Isomorphism Agorithm Based on the Discrete-Time Quantum Walk. Entropy. 2019; 21(6):569.Chicago/Turabian Style
Liu, Kai; Zhang, Yi; Lu, Kai; Wang, Xiaoping; Wang, Xin; Tian, Guojing. 2019. "MapEff: An Effective Graph Isomorphism Agorithm Based on the Discrete-Time Quantum Walk." Entropy 21, no. 6: 569.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.