Richard M. Karp, Raymond E. Miller
Journal of Computer and System Sciences
Let n vertices be distributed on the circumference of a circle in the plane. We find, for every n, the minimum number of cycles with no crossing edges such that every pair of vertices is adjacent on at least one cycle. The problem arises from the design of a train shuttle service between n cities with continuous guaranteed service at all times, and minimum number of rail lanes. © 1993.
Richard M. Karp, Raymond E. Miller
Journal of Computer and System Sciences
Hannaneh Hajishirzi, Julia Hockenmaier, et al.
UAI 2011
Fausto Bernardini, Holly Rushmeier
Proceedings of SPIE - The International Society for Optical Engineering
John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence