A Correspondence Measure for Graph Matching Using the Discrete Quantum Walk

DOI10.1007/978-3-540-72903-7_8zbMath1182.68146OpenAlexW1520123341MaRDI QIDQ5325720

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

Mathematics Subject Classification ID

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

Related Items (3)

Credible seed identification for large-scale structural network alignment ⋮ Quantum search algorithm for exceptional vertexes in regular graphs and its circuit implementation ⋮ Efficient Suboptimal Graph Isomorphism

Uses Software

• COIL-100

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