212 search results - page 11 / 43 » On Lengths of Rainbow Cycles |
VTS
2000
IEEE
14 years 2 months ago
2000
IEEE
A novel design-for-test (DFT) technique is presented for designing a core with a “virtual scan chain” which looks (to the system integrator) like it is shorter than the real s...
EJC
2006
13 years 9 months ago
2006
The digraphs P(n, k) have vertices corresponding to length k permutations of an n set and arcs corresponding to (k + 1) permutations. Answering a question of Starling, Klerlein, K...
APPROX
2008
Springer
13 years 11 months ago
2008
Springer
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
JCT
2010
13 years 8 months ago
2010
In the symmetric group on a set of size 2n, let P2n denote the conjugacy class of involutions with no fixed points (equivalently, we refer to these as “pairings”, since each ...
AES
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. While it is known previously that the cycle lengths of individual components of the AES round function are very small, we demonstrate here that the cycle length of the S-...