Abstract
In this paper, we present a novel method to construct a Hamiltonian cycle for an n × n general OTIS network. Our method is common for both odd and even value of n in contrast to two separate schemes for odd and even n as described in [1]. We also provide an algorithm that generates a Hamiltonian cycle of a general (n + 2k) × (n + 2k) OTIS network directly from a basic Hamiltonian cycle of an n × n OTIS network. © 2010 Springer.
Author supplied keywords
Cite
CITATION STYLE
Kumar, N., Kumar, R., Mallick, D. K., & Jana, P. K. (2010). Hamiltonicity of a general OTIS network (Short paper). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5935 LNCS, pp. 459–465). https://doi.org/10.1007/978-3-642-11322-2_43
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
