Joy Y. Cheng, Daniel P. Sanders, et al.
SPIE Advanced Lithography 2008
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.
Joy Y. Cheng, Daniel P. Sanders, et al.
SPIE Advanced Lithography 2008
Timothy J. Wiltshire, Joseph P. Kirk, et al.
SPIE Advanced Lithography 1998
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
I.K. Pour, D.J. Krajnovich, et al.
SPIE Optical Materials for High Average Power Lasers 1992