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

Kai Lu, Yi Zhang, Kai Xu, Yinghui Gao, Richard C. Wilson. Approximate Maximum Common Sub-graph Isomorphism Based on Discrete-Time Quantum Walk. In 22nd International Conference on Pattern Recognition, ICPR 2014, Stockholm, Sweden, August 24-28, 2014. pages 1413-1418, IEEE, 2014. [doi]

@inproceedings{LuZXGW14,
  title = {Approximate Maximum Common Sub-graph Isomorphism Based on Discrete-Time Quantum Walk},
  author = {Kai Lu and Yi Zhang and Kai Xu and Yinghui Gao and Richard C. Wilson},
  year = {2014},
  doi = {10.1109/ICPR.2014.252},
  url = {http://dx.doi.org/10.1109/ICPR.2014.252},
  researchr = {https://researchr.org/publication/LuZXGW14},
  cites = {0},
  citedby = {0},
  pages = {1413-1418},
  booktitle = {22nd International Conference on Pattern Recognition, ICPR 2014, Stockholm, Sweden, August 24-28, 2014},
  publisher = {IEEE},
  isbn = {978-1-4799-5208-3},
}