5473 search results - page 23 / 1095 » On the graph isomorphism problem |
CORR
2008
Springer
14 years 12 months ago
2008
Springer
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
STACS
1993
Springer
15 years 3 months ago
1993
Springer
We show that for most complexity classes of interest, all sets complete under rstorder projections (fops) are isomorphic under rst-order isomorphisms. That is, a very restricted v...
FPL
2000
Springer
15 years 3 months ago
2000
Springer
Many applications can be modeled as subgraph isomorphism problems. However, this problem is generally NP-complete and difficult to compute. A custom computing circuit is a prospect...
STACS
2010
Springer
15 years 6 months ago
2010
Springer
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved effi...
IEEEVAST
2010
14 years 6 months ago
2010
Interaction and manual manipulation have been shown in the cognitive science literature to play a critical role in problem solving. Given different types of interactions or constr...