Sciweavers

544 search results - page 52 / 109
» Overlap in consistent cycles
Sort
View
JGT
2006
92views more  JGT 2006»
14 years 10 months ago
Characterization of edge-colored complete graphs with properly colored Hamilton paths
An edge-colored graph H is properly colored if no two adjacent edges of H have the same color. In 1997, J. Bang-Jensen and G. Gutin conjectured that an edgecolored complete graph ...
Jinfeng Feng, Hans-Erik Giesen, Yubao Guo, Gregory...
ENDM
2007
70views more  ENDM 2007»
14 years 10 months ago
Hamiltonian fault-tolerance of hypercubes
Given a set F of faulty edges or faulty vertices in the hypercube Qn and a pair of vertices u, v, is there a hamiltonian cycle or a hamiltonian path between u and v in Qn −F? We...
Tomás Dvorák, Petr Gregor
DAM
1999
132views more  DAM 1999»
14 years 9 months ago
Data-dependent Bounds for the General and the Asymmetric Stacker-Crane Problems
The Stacker-Crane Problem (SCP) isa sequencing problem, arising inscheduling and transportation, that consists of nding the minimum cost cycle on a mixed graph with oriented arcs ...
Giovanni Righini, Marco Trubian
KI
2010
Springer
14 years 4 months ago
Towards Automatic Manipulation Action Planning for Service Robots
A service robot should be able to automatically plan manipulation actions to help people in domestic environments. Following the classic senseplan-act cycle, in this paper we prese...
Steffen W. Ruehl, Zhixing Xue, Thilo Kerscher, R&u...
DASFAA
2003
IEEE
139views Database» more  DASFAA 2003»
15 years 3 months ago
Freshness-driven Adaptive Caching for Dynamic Content
With the wide availability of content delivery networks, many e-commerce Web applications utilize edge cache servers to cache and deliver dynamic contents at locations much closer...
Wen-Syan Li, Oliver Po, Wang-Pin Hsiung, K. Sel&cc...