| Registrati | Log in | FAQ | [?] |
A Polynominal Time Algorithm for Graph Isomorphismby: Reiner Czerwinski
(13 Nov 2007)
|
Reviews
[Write a review of this article]
There are no reviews of this article
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
AbstractAlgorithms testing two graphs for isomorphism known as yet have exponential worst case complexity. In this paper we propose a new algorithm that has polynomial complexity and constructively supplies the evidence that the graph isomorphism lies in P.
BibTeX record
RIS record