114 search results - page 5 / 23 » On Infinite Cycles II |
SIAMDM
2010
13 years 4 months ago
2010
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
CONCUR
2000
Springer
14 years 1 months ago
2000
Springer
We introduce some new models of infinite-state transition systems. The basic model, called a (reversal-bounded) counter machine (CM), is a nondeterministic finite automaton augment...
SIAMAM
2008
13 years 9 months ago
2008
Motivated by a class of orbit problems in astrophysics, this paper considers solutions to Hill's equation with forcing strength parameters that vary from cycle to cycle. The ...
DM
2008
13 years 10 months ago
2008
A simple graph G is k-ordered (respectively, k-ordered hamiltonian) if, for any sequence of k distinct vertices v1, . . . , vk of G, there exists a cycle (respectively, a hamilton...
ICALP
1994
Springer
14 years 1 months ago
1994
Springer
We describe efficient algorithms for finding even cycles in undirected graphs. Our main results are the following: (i) For every k 2, there is an O(V 2) time algorithm that decide...