Another research I did in Spring 2008, this time on the graph isomorphism problem. It is an interesting problem that is yet unknown to be whether in P or NP-Complete so I worked on trying to come up with a polynomial time solution and tried various different approaches that other people seemed to not have tried yet like reducing an n-complete graph into the two input graphs and wasn’t completely successful but I came up with a method that seemed to show some success in a subset of graphs using sorting algorithms.
Hopefully this paper will get other people interested and maybe someone might find a polynomial time solution to the GI problem from an idea derived from here.
Download Article