Fast exact graph matching using adjacency matrices

Marlon Etheredge. Fast exact graph matching using adjacency matrices. In Proceedings of the The third workshop on Procedural Content Generation in Games, PCG@FDG 2012, Raleigh, NC, USA, May 29 - June 1, 2012. ACM, 2012. [doi]

@inproceedings{Etheredge12,
  title = {Fast exact graph matching using adjacency matrices},
  author = {Marlon Etheredge},
  year = {2012},
  doi = {10.1145/2538528.2538536},
  url = {http://doi.acm.org/10.1145/2538528.2538536},
  researchr = {https://researchr.org/publication/Etheredge12},
  cites = {0},
  citedby = {0},
  booktitle = {Proceedings of the The third workshop on Procedural Content Generation in Games, PCG@FDG 2012, Raleigh, NC, USA, May 29 - June 1, 2012},
  publisher = {ACM},
  isbn = {978-1-4503-1447-3},
}