Skip to content

Latest commit

 

History

History
4 lines (3 loc) · 429 Bytes

README.md

File metadata and controls

4 lines (3 loc) · 429 Bytes

A graph isomorphism program that checks the isomorphism of two graphs and calculates their automorphism group. The program's implementation relies on key data structures, algorithms, and insights outlined by William Kocay1.

Footnotes

  1. Kocay, W. (1996). On Writing Isomorphism Programs. In W. D. Wallis (Ed.), Computational and Constructive Design Theory (pp. 135–175). Springer US. https://doi.org/10.1007/978-1-4757-2497-4_6