1097 search results - page 2 / 220 » Testing Graph Isomorphism |
AMAI
2004
Springer
13 years 10 months ago
2004
Springer
In this paper the use of graph isomorphism is investigated within the framework of symmetry breaking in constraint satisfaction problems. A running example of Comma-free codes is ...
WEA
2009
Springer
14 years 2 days 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
2007
Springer
13 years 11 months ago
2007
Springer
SIAMCOMP
2008
13 years 5 months ago
2008
GD
1999
Springer
13 years 9 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...