The complixity of McKay's canonical labeling algorithm

Takunari Miyazaki. The complixity of McKay's canonical labeling algorithm. In Larry Finkelstein, William M. Kantor, editors, Groups and Computation II, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, June 7-10, 1995. Volume 28 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 239-256, DIMACS/AMS, 1995.

@inproceedings{Miyazaki95,
  title = {The complixity of McKay's canonical labeling algorithm},
  author = {Takunari Miyazaki},
  year = {1995},
  researchr = {https://researchr.org/publication/Miyazaki95},
  cites = {0},
  citedby = {0},
  pages = {239-256},
  booktitle = {Groups and Computation II, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, June 7-10, 1995},
  editor = {Larry Finkelstein and William M. Kantor},
  volume = {28},
  series = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science},
  publisher = {DIMACS/AMS},
}