Quantum walk inspired algorithm for graph similarity and isomorphism
From MaRDI portal
Publication:2681642
DOI10.1007/s11128-020-02758-7OpenAlexW3081124664MaRDI QIDQ2681642
Yuying Li, Callum Schofield, Jingbo B. Wang
Publication date: 3 February 2023
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.11105
Social networks; opinion dynamics (91D30) Quantum computation (81P68) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Unnamed Item
- Unnamed Item
- Fifty years of graph matching, network alignment and network comparison
- Diffusion in complex social networks
- A note on the derivation of maximal common subgraphs of two directed or undirected graphs
- Strongly regular graphs, partial geometries and partially balanced designs
- Emergence of Scaling in Random Networks
- An eigendecomposition approach to weighted graph matching problems
- A graph distance metric based on the maximal common subgraph
- A classical approach to the graph isomorphism problem using quantum walks
- Quantum simulations of classical random walks and undirected graph connectivity
This page was built for publication: Quantum walk inspired algorithm for graph similarity and isomorphism
