Isomorphism of graphs-a polynomial test
<|reference_start|>Isomorphism of graphs-a polynomial test: An explicit algorithm is presented for testing whether two non-directed graphs are isomorphic or not. It is shown that for a graph of n vertices, the number of n independent operations needed for the test is polynomial in n. A proof that the algorithm actually performs the test is presented.<|reference_end|>
@article{schwartz2005isomorphism,
    title={Isomorphism of graphs-a polynomial test},
    author={Moshe Schwartz},
    journal={arXiv preprint arXiv:cs/0507014},
    year={2005},
    archivePrefix={arXiv},
    eprint={cs/0507014},
    primaryClass={cs.DS}
}