618 search results - page 15 / 124 » Short cycle connectivity |
SIAMCOMP
2010
13 years 4 months ago
2010
We describe algorithms to compute the shortest path homotopic to a given path, or the shortest cycle freely homotopic to a given cycle, on an orientable combinatorial surface. Unli...
JUCS
2007
13 years 9 months ago
2007
: In this paper we study connectivity and hamiltonicity properties of the topological grid graphs, which are a natural type of planar graphs associated with finite subgraphs of th...
DIGRA
2005
Springer
14 years 3 months ago
2005
Springer
Videogames have been studied seriously only for a few years. So, we can wonder how we could use the recent academic works to approach new design methods. This article proposes a f...
ICRA
2000
IEEE
14 years 2 months ago
2000
IEEE
This paper addresses the following inspection problem: given a known workspace and a robot with vision capabilities compute a short path path for the robot such that each point on...
COMBINATORICS
2006
13 years 9 months ago
2006
A simple, undirected 2-connected graph G of order n belongs to class O(n,), 0, if 2 = n - . It is well known (Ore's theorem) that G is hamiltonian if = 0, in which case the 2...