251 search results - page 11 / 51 » Graph Isomorphism is in SPP |
134
Voted
CPAIOR
2004
Springer
15 years 7 months 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...
129
Voted
GC
2010
Springer
15 years 27 days ago
2010
Springer
A graph of order n is said to be pancyclic if it contains cycles of all lengths from three to n. Let G be a hamiltonian graph and let x and y be vertices of G that are consecutive ...
106
Voted
WEA
2009
Springer
15 years 10 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...
156
click to vote
STACS
2010
Springer
15 years 10 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...
114
Voted
FSTTCS
2007
Springer
15 years 9 months ago
2007
Springer