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 ...
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...
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 ...
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...
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...