Graph isomorphism problem

Known as: GI, Isomorphism problem, GI (complexity)

The graph isomorphism problem is the computational problem of determining whether two finite graphs are isomorphic. The problem is neither known to…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2009

We present a new polynomial-time algorithm for determining whether two given graphs are isomorphic or not. We prove that the…

2006

In spite of its 150 years history, the problem of classifying all finite-dimensional division algebras over a field k is still…

2006

The graph isomorphism is to find a bijection between the vertexes of two graphs that preserve the edges. This problem has been…

2006

Using logspace counting classes we study the computational complexity of hypergraph and graph isomorphism where the vertex sets…

2005

In this paper we suggest an algorithm for graph isomorphism problem which computes a number of walks between vertices. We study…

2004

2004

In this paper I propose a polynomial time algorithm for the Graph Isomorphism problem, which always returns a correct answer in…

2003

The graph isomorphism problem is famous, still unsolved problem from the graph theory. In this paper we deal with some…

1994

We consider the families of matrix algebras over C associated with graphs. Restricting the multiplicity of the irreducible…

1992

Although the Hopfield neural networks is known to provide an efficient algorithm for hard problems, it cannot always give the…