192 search results - page 1 / 39 » On Graph Isomorphism for Restricted Graph Classes |
CIE
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
STACS
2010
Springer
13 years 11 months ago
2010
Springer
The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time [2],[19]. We give restricted spa...
CIE
2008
Springer
13 years 6 months ago
2008
Springer
A computable graph is computably categorical if any two computable presentations of the graph are computably isomorphic. In this paper we investigate the class of computably catego...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
The isomorphism problem for planar graphs is known to be efficiently solvable. For planar 3-connected graphs, the isomorphism problem can be solved by efficient parallel algorithm...
GG
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. In the context of graph transformation we look at the operation of switching, which can be viewed as an elegant method for realizing global transformations of (group-labe...