Isomorphism of graphs-a polynomial test
| dc.creator | Schwartz, Moshe | |
| dc.date | 2005-07-06 | |
| dc.date.accessioned | 2026-07-07T03:23:12Z | |
| dc.date.available | 2026-07-07T03:23:12Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/cs/0507014 | |
| dc.identifier | http://arxiv.org/abs/cs/0507014 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/32852 | |
| dc.subject | Data Structures and Algorithms | |
| dc.title | Isomorphism of graphs-a polynomial test | |
| dc.type | text |