The Balanced Hamiltonian Cycle on the Toroidal Mesh Graphs
The balanced Hamiltonian cycle problemis a quiet new topic of graph theorem. Given a graph G = (V, E), whose edge set can be partitioned into k dimensions, for positive integer k and a Hamiltonian cycle C on G. The set of all i-dimensional edge of C, which is a subset by E(C), is denoted as Ei(C).
[1] Y. Y. Chin, Binary and M-ary Structure Light Patterns with Gray Coding
Rule in Active Non-contact 3D Surface Scanning. Master-s Thesis of Department of Computer Science and Information Engineering, National Chi-Nan University, 2009.
[2] E. Horn and N. Kiryati, "Toward optimal structured light patterns,"
Proceedings of the International Conference on Recent Advances in 3-D
Digital Imaging and Modeling, pp. 28-35, 1997.
[3] S. P. Koninckx, and L. V. Gool, "Real-time range acquisition by adaptive
structured light," IEEE Transactions on Pattern Analysis and Machine
Intelligence, vol. 28, No. 3, pp. 432-445, 2006.
[4] S. Novotny, J. Ortiz, and D. A. Narayan, "Minimal k-rankings and the
rank number of p2xpn," Information Processing Letters, vol. 109, pp.
193-198, 2009.
[5] J. Salvi, J. Pag'es, and J. Batlle, "Pattern codification strategies in
structure light systems," Pattern Recognition, vol. 37, pp. 827 849,
2004.
[6] Hou-Ren Wang, The Balanced Hamiltonian Cycle problem. Master-s
Thesis of Department of Computer Science and Information Engineering,
National Chi-Nan University, 2011.
[7] Hou-Ren Wang, Bo-Han Wu and Justie Su-Tzu Juan, "The Balanced
Hamiltonian Cycle Problem", manuscript.
[8] S. H. Wang, 3-D Surface Acquisition with Non-Uniform Albedo Using
Structured Light Range Sensor. Master-s Thesis of Department of
Computer Science and Information Engineering, National Chi-Nan
University, 2007.
[9] Tai-Lung Wu, Edge Ranking Problem on Cartesian Product Graphs.
Master-s Thesis of Department of Computer Science and Information
Engineering, National Chi-Nan University, 2010.
[1] Y. Y. Chin, Binary and M-ary Structure Light Patterns with Gray Coding
Rule in Active Non-contact 3D Surface Scanning. Master-s Thesis of Department of Computer Science and Information Engineering, National Chi-Nan University, 2009.
[2] E. Horn and N. Kiryati, "Toward optimal structured light patterns,"
Proceedings of the International Conference on Recent Advances in 3-D
Digital Imaging and Modeling, pp. 28-35, 1997.
[3] S. P. Koninckx, and L. V. Gool, "Real-time range acquisition by adaptive
structured light," IEEE Transactions on Pattern Analysis and Machine
Intelligence, vol. 28, No. 3, pp. 432-445, 2006.
[4] S. Novotny, J. Ortiz, and D. A. Narayan, "Minimal k-rankings and the
rank number of p2xpn," Information Processing Letters, vol. 109, pp.
193-198, 2009.
[5] J. Salvi, J. Pag'es, and J. Batlle, "Pattern codification strategies in
structure light systems," Pattern Recognition, vol. 37, pp. 827 849,
2004.
[6] Hou-Ren Wang, The Balanced Hamiltonian Cycle problem. Master-s
Thesis of Department of Computer Science and Information Engineering,
National Chi-Nan University, 2011.
[7] Hou-Ren Wang, Bo-Han Wu and Justie Su-Tzu Juan, "The Balanced
Hamiltonian Cycle Problem", manuscript.
[8] S. H. Wang, 3-D Surface Acquisition with Non-Uniform Albedo Using
Structured Light Range Sensor. Master-s Thesis of Department of
Computer Science and Information Engineering, National Chi-Nan
University, 2007.
[9] Tai-Lung Wu, Edge Ranking Problem on Cartesian Product Graphs.
Master-s Thesis of Department of Computer Science and Information
Engineering, National Chi-Nan University, 2010.
@article{"International Journal of Information, Control and Computer Sciences:49648", author = "Wen-Fang Peng and Justie Su-Tzu Juan", title = "The Balanced Hamiltonian Cycle on the Toroidal Mesh Graphs", abstract = "The balanced Hamiltonian cycle problemis a quiet new topic of graph theorem. Given a graph G = (V, E), whose edge set can be partitioned into k dimensions, for positive integer k and a Hamiltonian cycle C on G. The set of all i-dimensional edge of C, which is a subset by E(C), is denoted as Ei(C).
", keywords = "Hamiltonian cycle, balanced, Cartesian product.", volume = "6", number = "5", pages = "546-7", }
