Get Time
Search | Watch Thread  |  My Post History  |  My Watches  |  User Settings
View: Flat  | Threaded  | Tree
Previous Thread  |  Next Thread
Proposed O(N^5) algorithm solving Graph Isomorphism problem | Reply
Here I give the algorithm (as a C++ program), but no math proof yet. Please, challenge it first with counterexamples or acknowledge that it passes your tests.

I claim that the algorithm solves a formerly unsolved problem in Computer Science: polynomial-time comparison of graphs (given 2 graphs as adjacency matrices, find a permutation for the rows&columns of the second graph so that the permuted adjacency matrix matches the adjacency matrix of the first graph). The key consequence is that Graph Isomorphism problem belongs to computational complexity class P, because there is a polynomial-time algorithm that solves this problem.