5473 search results - page 4 / 1095 » On the graph isomorphism problem |
FSTTCS
2008
Springer
13 years 11 months ago
2008
Springer
We consider the isomorphism and canonization problem for 3-connected planar graphs. The problem was known to be L -hard and in UL ∩ coUL [TW08]. In this paper, we give a determin...
GD
1999
Springer
14 years 2 months ago
1999
Springer
The isomorphic subgraph problem is finding two disjoint subgraphs of a graph which coincide on at least k edges. The graph is partitioned into a subgraph, its copy, and a remaind...
RELMICS
2000
Springer
14 years 1 months ago
2000
Springer
This paper presents a novel approach to the problem of finding all subgraph isomorphisms of a (pattern) graph into another (target) graph. A relational formulation of the problem, ...
STACS
1987
Springer
14 years 1 months 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...
ISAAC
2010
Springer
13 years 7 months ago
2010
Springer
The Induced Subgraph Isomorphism problem on two input graphs G and H is to decide whether G has an induced subgraph isomorphic to H. Already for the restricted case where H is a c...