618 search results - page 24 / 124 » Short cycle connectivity |
GD
2009
Springer
14 years 2 months ago
2009
Springer
Let n ≥ 4 be even. It is shown that every set S of n points in the plane can be connected by a (possibly self-intersecting) spanning tour (Hamiltonian cycle) consisting of n str...
JGAA
2006
13 years 9 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
CORR
2004
Springer
13 years 9 months ago
2004
Springer
In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz's answer sets semantics (initially defined as `stable model semantics...
WCRE
2009
IEEE
14 years 4 months ago
2009
IEEE
Abstract—Object-oriented (OO) software is usually organized into subsystems using the concepts of package or module. Such modular structure helps applications to evolve when faci...
IPPS
2007
IEEE
14 years 4 months ago
2007
IEEE
Our goal is to save energy in wireless sensor networks (WSNs) by periodic duty-cycling of sensor nodes. We schedule sensor nodes between active (transmit or receive) and sleep mod...