5473 search results - page 79 / 1095 » On the graph isomorphism problem |
111
click to vote
FOSSACS
2006
Springer
15 years 3 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
14 years 12 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...
RSA
2002
14 years 11 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 :...
IJAC
2010
14 years 9 months ago
2010
Let C(T) be a generalized Coxeter group, which has a natural map onto one of the classical Coxeter groups, either Bn or Dn. Let CY (T) be a natural quotient of C(T), and if C(T) is...
SIAMDM
2008
14 years 11 months ago
2008
We establish new lower and upper bounds for the real number graph labelling problem. As an application, we completely determine the optimum spans of L(p, q)-labellings of the infin...