Polynomial Time Symmetry and Isomorphism Testing for Connected Graphs
| dc.creator | Delacorte, Matthew | |
| dc.date | 2006-12-01 | |
| dc.date.accessioned | 2026-07-07T07:31:48Z | |
| dc.date.available | 2026-07-07T07:31:48Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/cs/0612001 | |
| dc.identifier | http://arxiv.org/abs/cs/0612001 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/118887 | |
| dc.subject | Discrete Mathematics | |
| dc.title | Polynomial Time Symmetry and Isomorphism Testing for Connected Graphs | |
| dc.type | text |