Graph Embedding Using Quantum Commute Times

DOI10.1007/978-3-540-72903-7_34MaRDI QIDQ5325757zbMATH OpenOpenAlexFDO

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

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_34

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Random walks on graphs (05C81) Learning and adaptive systems in artificial intelligence (68T05) Quantum computation (81P68)

Recommendations

• scientific article; zbMATH DE number 5573019
• Graph matching using the interference of continuous-time quantum walks
• A hybrid classical-quantum clustering algorithm based on quantum walks
• Correlation between the continuous-time quantum walk and cliques in graphs and its application
• A Quantum Jensen-Shannon Graph Kernel Using Discrete-Time Quantum Walks

Cited in

(7)

• A long trip in the charming world of graphs for pattern recognition
• Fuzzy multilevel graph embedding
• Similarity analysis from limiting quantum walks
• The graph matching problem
• Quantum walk and its application domains: a systematic review
• QUANTUM HITTING TIME ON THE COMPLETE GRAPH
• scientific article; zbMATH DE number 5573019 (Why is no real title available?)

This page was built for publication: Graph Embedding Using Quantum Commute Times

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