|
|||||
|
|
A nonfactorial algorithm for testing isomorphism of two graphs |
|
| Authors: | Mark.K. Goldberg |
| Affiliation: | Department of Mathematics and Computer Science, Clarkson College of Technology, Potsdam, NY 13676, USA |
| Abstract: | An algorithm is constructed for checking two graphs for isomorphism. It is proved that the worst case running time of the algorithm is O(exp(n)) where n is the size of a graph. This is the first substantial improvement on naive n! algorithms. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |