Polynomial Time Symmetry and Isomorphism Testing for Connected Graphs
<|reference_start|>Polynomial Time Symmetry and Isomorphism Testing for Connected Graphs: We use the concept of a Kirchhoff resistor network (alternatively random walk on a network) to probe connected graphs and produce symmetry revealing canonical labelings of the graph(s) nodes and edges.<|reference_end|>
@article{delacorte2006polynomial,
    title={Polynomial Time Symmetry and Isomorphism Testing for Connected Graphs},
    author={Matthew Delacorte},
    journal={arXiv preprint arXiv:cs/0612001},
    year={2006},
    archivePrefix={arXiv},
    eprint={cs/0612001},
    primaryClass={cs.DM}
}