Login / Signup

Approximate Maximum Common Sub-graph Isomorphism Based on Discrete-Time Quantum Walk.

Kai LuYi ZhangKai XuYinghui GaoRichard C. Wilson
Published in: ICPR (2014)
Keyphrases
  • graph isomorphism
  • graph search
  • graph mining
  • random walk
  • markov chain
  • graph databases
  • subgraph isomorphism
  • object recognition
  • multi dimensional
  • distance measure