Isomorphism of graphs-a polynomial test
Data Structures and Algorithms
2007-05-23 v1
Abstract
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.
Cite
@article{arxiv.cs/0507014,
title = {Isomorphism of graphs-a polynomial test},
author = {Moshe Schwartz},
journal= {arXiv preprint arXiv:cs/0507014},
year = {2007}
}