A Correspondence Measure for Graph Matching Using the Discrete Quantum Walk

DOI10.1007/978-3-540-72903-7_8zbMATH Open1182.68146OpenAlexW1520123341MaRDI QIDQ5325720FDOQ5325720

Edwin R. Hancock, David Emms, Richard C. Wilson

Publication date: 24 July 2009

Published in: Graph-Based Representations in Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72903-7_8

Recommendations

• Graph matching using the interference of continuous-time quantum walks
• Coined quantum walks lift the cospectrality of graphs and trees
• Graph-Based Representations in Pattern Recognition
• QUANTUM WALKS ON GENERAL GRAPHS
• Quantum algorithms for matching problems

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Graph theory (including graph drawing) in computer science (68R10) Quantum algorithms and complexity in the theory of computing (68Q12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Cited In (6)

• Credible seed identification for large-scale structural network alignment
• Graph-Based Representations in Pattern Recognition
• Graph matching using the interference of continuous-time quantum walks
• Efficient Suboptimal Graph Isomorphism
• Coined quantum walks lift the cospectrality of graphs and trees
• Quantum search algorithm for exceptional vertexes in regular graphs and its circuit implementation

Uses Software

• COIL-100

This page was built for publication: A Correspondence Measure for Graph Matching Using the Discrete Quantum Walk

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5325720)