Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,766,422 papers from all fields of science
Search
Sign In
Create Free Account
Graph isomorphism problem
Known as:
GI
, Isomorphism problem
, GI (complexity)
Expand
The graph isomorphism problem is the computational problem of determining whether two finite graphs are isomorphic. The problem is neither known to…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
ACM Transactions on Algorithms
Arthur–Merlin protocol
Best, worst and average case
Brian Alspach
Expand
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
Huiliang Shang
,
Yudong Tao
,
Yuan Gao
,
Chen Zhang
,
Xiaoling Wang
IEEE Transactions on Systems, Man, and…
2015
Corpus ID: 25107916
The molecular graph is a specific kind of graph. The classical method to solve the molecular graph matching problem is VF2…
Expand
2009
2009
Problems of Unknown Complexity: Graph isomorphism and Ramsey theoretic numbers
Pascal Schweitzer
,
K. Mehlhorn
,
Markus Bläser
2009
Corpus ID: 263393564
We consider three computational problems with unknown complexity status: The graph isomorphism problem, the problem of computing…
Expand
2009
2009
THE GRAPH ISOMORPHISM ALGORITHM
Ashay Dharwadker
,
Shabtai Teveth
2009
Corpus ID: 123098757
We present a new polynomial-time algorithm for determining whether two given graphs are isomorphic or not. We prove that the…
Expand
2007
2007
Physical and chemical limnology of alpine lakes and pools in the Rwenzori Mountains (Uganda–DR Congo)
H. Eggermont
,
J. Russell
,
G. Schettler
,
K. Damme
,
I. Bessems
,
D. Verschuren
Hydrobiologia
2007
Corpus ID: 44241872
This study describes the physical and chemical properties of 17 Afroalpine lakes (>2 m deep) and 11 pools (<2 m deep) in the…
Expand
2007
2007
A Geometric Framework for the Subfield Problem of Generic Polynomials Via Tschirnhausen Transformation
Akinari Hoshi
,
K. Miyake
2007
Corpus ID: 3192839
Let k be an arbitrary field. We study a general method to solve the subfield problem of generic polynomials for the symmetric…
Expand
2006
2006
On the classification of the real flexible division algebras
Erik Darpö
2006
Corpus ID: 55310831
In spite of its 150 years history, the problem of classifying all finite-dimensional division algebras over a field k is still…
Expand
2005
2005
ON CERTAIN ALGORITHM FOR GRAPH ISOMORPHISM PROBLEM
Peter Czimmermann
2005
Corpus ID: 117105650
In this paper we suggest an algorithm for graph isomorphism problem which computes a number of walks between vertices. We study…
Expand
2004
2004
On the reducibility of sets inside NP to sets with low information content
Mitsunori Ogihara
,
Till Tantau
Journal of computer and system sciences (Print)
2004
Corpus ID: 11030898
2004
2004
Approaches to Solving the Graph Isomorphism Problem
Jordan Eikenberry
2004
Corpus ID: 16113326
In this paper I propose a polynomial time algorithm for the Graph Isomorphism problem, which always returns a correct answer in…
Expand
1992
1992
On neural networks for graph isomorphism problem
K. Agusa
,
S. Fujita
,
M. Yamashita
,
T. Ae
[Proceedings] RNNS/IEEE Symposium on…
1992
Corpus ID: 120523923
Although the Hopfield neural networks is known to provide an efficient algorithm for hard problems, it cannot always give the…
Expand
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)
ACCEPT & CONTINUE