1097 search results - page 58 / 220 » Testing Graph Isomorphism |
MFCS
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We devise an efficient protocol by which a series of twoperson games Gi with unique winning strategies can be combined into a single game G with unique winning strategy, ...
135
click to vote
FOSSACS
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Rewriting systems over adhesive categories have been recently introduced as a general framework which encompasses several rewriting-based computational formalisms, includ...
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Circular words are cyclically ordered finite sequences of letters. We give a computer-free proof of the following result by Currie: square-free circular words over the ternary alp...
108
click to vote
AIR
2006
15 years 2 months ago
2006
Abstract We describe an instance-based reasoning solution to a variety of spatial reasoning problems. The solution centers on identifying an isomorphic mapping between labelled gra...
104
click to vote
RSA
2002
15 years 2 months ago
2002
Let be a finite index set and k 1 a given integer. Let further S []k be an arbitrary family of k element subsets of . Consider a (binomial) random subset p of , where p = (pi :...