A Polynomial Time Algorithm for Graph Isomorphism
نویسنده
چکیده
Algorithms testing two graphs for isomorphism known as yet in computer science have exponential worst case complexity. In this paper we propose an algorithm that has polynomial complexity and constructively supplies the evidence that the graph isomorphism lies in P.
منابع مشابه
Polynomial-time Algorithm for Isomorphism of Graphs with Clique-width at most 3
The clique-width is a measure of complexity of decomposing graphs into certain tree-like structures. The class of graphs with bounded clique-width contains bounded tree-width graphs. While there are many results on the graph isomorphism problem for bounded treewidth graphs, very little is known about isomorphism of bounded cliquewidth graphs. We give the first polynomial-time graph isomorphism ...
متن کاملStructural and logical approaches to the graph isomorphism problem
The question of whether there is a polynomial time algorithm deciding whether two graphs are isomorphic has been a one of the best known open problems in theoretical computer science for more than forty years. Indeed, the graph isomorphism problem is one of the very few natural problems in NP that is neither known to be in P nor known to be NP-complete. The question is still wide open, but a nu...
متن کاملA Polynomial Time Graph Isomorphism Algorithm For Graphs That Are Not Locally Triangle-Free
In this paper, we show the existence of a polynomial time graph isomorphism algorithm for a restricted class of graphs which are not triangle-free graphs. We consider graphs that have atleast 2 vertices in all rearranged sub-graphs. An Individualization-Refinement procedure(1 Dimensional Weisfeiler-Lehman Method) is used to rearrange one graph which splits the graph into disjoint vertex sets. T...
متن کاملIp1 Structural and Logical Approaches to the Graph Isomorphism Problem Ip2 Belief Propagation Algorithms: from Matching to Cancer Genomics Cp1 Dimension Reduction for Finite Trees in L1
The question of whether there is a polynomial time algorithm deciding whether two graphs are isomorphic has been a one of the best known open problems in theoretical computer science for more than forty years. Indeed, the graph isomorphism problem is one of the very few natural problems in NP that is neither known to be in P nor known to be NP-complete. The question is still wide open, but a nu...
متن کاملOn the Complexity of Matroid Isomorphism Problems
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σ 2 . In the case of linear matroids, which are represented over polynomially growing fields, we note that the problem is unlikely to be Σ 2 -complete and is coNPhard. We show that when the rank of the matroid is bounded by a constant, linear matroid isomorphism and matroid isomorphism a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0711.2010 شماره
صفحات -
تاریخ انتشار 2007