Graph Embedding Using Quantum Commute Times

DOI10.1007/978-3-540-72903-7_34zbMath1182.68167OpenAlexW1556271304MaRDI QIDQ5325757

David Emms, Edwin R. Hancock, 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_34

Mathematics Subject Classification ID

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

Related Items (4)

A long trip in the charming world of graphs for pattern recognition ⋮ Quantum walk and its application domains: a systematic review ⋮ The graph matching problem ⋮ Fuzzy multilevel graph embedding

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