882 search results - page 11 / 177 » On the Hardness of Graph Isomorphism |
COMBINATORICS
2007
13 years 8 months ago
2007
A graph is self-complementary if it is isomorphic to its complement. In this paper we prove that every forest of order 4p and size less than 3p is a subgraph of a self-complementa...
STACS
1987
Springer
14 years 2 days ago
1987
Springer
It is shown that the graph isomorphism problem is located in the low hierarchy in NP. This implies that this problem is not NPcomplete (not even under weaker forms of polynomial-ti...
CPAIOR
2004
Springer
14 years 10 days ago
2004
Springer
The graph isomorphism problem consists in deciding if two given graphs have an identical structure. This problem can be modeled as a constraint satisfaction problem in a very strai...
WEA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. In this paper we present a novel approach to the graph isomorphism problem. We combine a direct approach, that tries to find a mapping between the two input graphs using...
STACS
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...