Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
ACM Transactions on AlgorithmsArthur–Merlin protocolBest, worst and average caseBrian Alspach

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
An Improved Invariant for Matching Molecular Graphs Based on VF2 Algorithm
The molecular graph is a specific kind of graph. The classical method to solve the molecular graph matching problem is VF2… 
2009
2009
Problems of Unknown Complexity: Graph isomorphism and Ramsey theoretic numbers
We consider three computational problems with unknown complexity status: The graph isomorphism problem, the problem of computing… 
2009
2009
THE GRAPH ISOMORPHISM ALGORITHM
We present a new polynomial-time algorithm for determining whether two given graphs are isomorphic or not. We prove that the… 
2007
2007
Physical and chemical limnology of alpine lakes and pools in the Rwenzori Mountains (Uganda–DR Congo)
This study describes the physical and chemical properties of 17 Afroalpine lakes (>2 m deep) and 11 pools (<2 m deep) in the… 
2007
2007
A Geometric Framework for the Subfield Problem of Generic Polynomials Via Tschirnhausen Transformation
Let k be an arbitrary field. We study a general method to solve the subfield problem of generic polynomials for the symmetric… 
2006
2006
On the classification of the real flexible division algebras
In spite of its 150 years history, the problem of classifying all finite-dimensional division algebras over a field k is still… 
2005
2005
ON CERTAIN ALGORITHM FOR GRAPH ISOMORPHISM PROBLEM
In this paper we suggest an algorithm for graph isomorphism problem which computes a number of walks between vertices. We study… 
2004
2004
On the reducibility of sets inside NP to sets with low information content
2004
2004
Approaches to Solving the Graph Isomorphism Problem
In this paper I propose a polynomial time algorithm for the Graph Isomorphism problem, which always returns a correct answer in… 
1992
1992
On neural networks for graph isomorphism problem
Although the Hopfield neural networks is known to provide an efficient algorithm for hard problems, it cannot always give the… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)