Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
Universal traversal sequences for d-regular n-vertex graphs require length Ω(d2n2 + dn2 log( n d)), for 3 ≤d≤ n 3 - 2. This is nearly tight for d = Θ(n). We also introduce and study several variations on the problem, e.g., edge-universal traversal sequences, showing how improved lower bounds on these would improve the bounds given above. © 1992.
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
Simeon Furrer, Dirk Dahlhaus
ISIT 2005
Mario Blaum, John L. Fan, et al.
IEEE International Symposium on Information Theory - Proceedings
Jaione Tirapu Azpiroz, Alan E. Rosenbluth, et al.
SPIE Photomask Technology + EUV Lithography 2009