Towards A Promising Edge Classification Algorithm for the Graph Isomorphism Problem

Research Authors

Islam A.T.F.Taj-Eddin, Samir Abou El-Seoud, and Jihad M. AL-Ja’am,

Research Department

Information Technology Department

Research Journal

International Journal of Computer Applications (IJCA), ISBN-(973-93-80873-53-2), Doi: 10.5120/10986-6144

Research Member

Islam Ali Taj-Eddin Fathalla Taj-Eddin

Research Rank

1

Research Publisher

Published by Foundation of Computer Science (FCS), New York, USA

Research Vol

Volume 65, Number 13

Research Website

http://www.ijcaonline.org/

Research Year

2013

Research_Pages

38-43

Research Abstract

For over three decades the Graph Isomorphism (GI) problem has been extensively studied by many researchers in algorithms and complexity theory. To date, there is no formal proof to classify this problem to be in the class P or the class NP. In this paper, evidence had been proposed of the existing of polynomial time algorithm based on edge classification which can be used to prove that GI is rather in the class P.