31 search results - page 3 / 7 » Asymptotic cycles |
WG
2007
Springer
13 years 12 months ago
2007
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
ALT
2006
Springer
14 years 2 months ago
2006
Springer
Consider an agent interacting with an environment in cycles. In every interaction cycle the agent is rewarded for its performance. We compare the average reward U from cycle 1 to ...
RSA
2008
13 years 5 months ago
2008
Let L be chosen uniformly at random from among the latin squares of order n 4 and let r, s be arbitrary distinct rows of L. We study the distribution of r,s, the permutation of t...
ARSCOM
2007
13 years 6 months ago
2007
Let us denote by EX (m, n; {C4, . . . , C2t}) the family of bipartite graphs G with m and n vertices in its classes that contain no cycles of length less than or equal to 2t and h...
RSA
2002
13 years 5 months ago
2002
: The decycling number (G) of a graph G is the smallest number of vertices which can be removed from G so that the resultant graph contains no cycles. In this paper, we study the d...