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.

2017

Let $G$ and $H$ be two simple graphs. A bijection $\phi:V(G)\rightarrow V(H)$ is called an isomorphism between $G$ and $H$ if…

2009

We consider three computational problems with unknown complexity status: The graph isomorphism problem, the problem of computing…

2009

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

2007

This study describes the physical and chemical properties of 17 Afroalpine lakes (>2 m deep) and 11 pools (<2 m deep) in 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…