A 2-dimensional optical architecture for solving Hamiltonian path problem based on micro ring resonators

Abstract The problem of finding the Hamiltonian path in a graph, or deciding whether a graph has a Hamiltonian path or not, is an NP-complete problem. No exact solution has been found yet, to solve this problem using polynomial amount of time and space. In this paper, we propose a two dimensional (2-D) optical architecture based on optical electronic devices such as micro ring resonators, optical circulators and MEMS based mirror (MEMS-M) to solve the Hamiltonian Path Problem, for undirected graphs in linear time. It uses a heuristic algorithm and employs n +1 different wavelengths of a light ray, to check whether a Hamiltonian path exists or not on a graph with n vertices. Then if a Hamiltonian path exists, it reports the path. The device complexity of the proposed architecture is O( n 2 ).

[1]  Mihai Oltean,et al.  Solving the Hamiltonian path problem with a light-based computer , 2007, Natural Computing.

[2]  Shlomi Dolev,et al.  The Traveling Beams Optical Solutions for Bounded NP-Complete Problems , 2007, FUN.

[3]  Shlomi Dolev,et al.  Masking traveling beams: Optical solutions for NP-complete problems, trading space for time , 2010, Theor. Comput. Sci..

[4]  David L. Dickensheets,et al.  High Speed Focus Control MEMS Mirror With Controlled Air Damping for Vital Microscopy , 2013, Journal of Microelectromechanical Systems.

[5]  Vladimir Estivill-Castro,et al.  Local search for Hamiltonian Path with applications to clustering visitation paths , 2004, J. Oper. Res. Soc..

[6]  D. G. Rabus,et al.  Integrated Ring Resonators , 2020, Springer Series in Optical Sciences.

[7]  Robert F. Love,et al.  Heuristic for the Hamiltonian Path Problem in Euclidian Two Space , 1979 .

[8]  Jian H. Zhao,et al.  Optical Filter Design and Analysis , 1999 .

[9]  Natan T. Shaked,et al.  Optical binary-matrix synthesis for solving bounded NP-complete combinatorial problems , 2007 .

[10]  Ian H. White,et al.  A simple device to allow enhanced bandwidths at 850 nm in multimode fibre links for gigabit LANs , 1999 .

[11]  Norbert Ascheuer,et al.  Hamiltonian path problems in the on-line optimization of flexible manufacturing systems , 1996 .

[12]  Aref Rasoulzadeh Zali,et al.  Internal photoemission-based photodetector on Si microring resonator. , 2012, Optics letters.

[13]  J. Khoury,et al.  Patterned Multipixel Membrane Mirror MEMS Optically Addressed Spatial Light Modulator With Megahertz Response , 2007, IEEE Photonics Technology Letters.

[14]  Saeed Jalili,et al.  A new light-based solution to the Hamiltonian path problem , 2013, Future Gener. Comput. Syst..

[15]  Shlomi Dolev,et al.  Optical Solver of Combinatorial Problems: Nano-Technological Approach , 2012, Journal of the Optical Society of America. A, Optics, image science, and vision.

[16]  F. Xia,et al.  Graphene photodetectors for high-speed optical communications , 2010, 1009.4465.

[17]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems , 1998, JACM.

[18]  R. Olsson,et al.  High-Speed MEMS Micromirror Switching , 2007, 2007 Conference on Lasers and Electro-Optics (CLEO).

[19]  Leslie G. Valiant,et al.  Fast probabilistic algorithms for hamiltonian circuits and matchings , 1977, STOC '77.

[20]  Frank Rubin,et al.  A Search Procedure for Hamilton Paths and Circuits , 1974, JACM.

[21]  V. Ahmadi,et al.  Microring-Based Resonant Cavity Waveguide Photodetectors for WDM Optical Systems , 2007, 2007 9th International Conference on Transparent Optical Networks.

[22]  Shlomi Dolev,et al.  Optical solution for bounded NP-complete problems. , 2007, Applied optics.

[23]  H. Orland,et al.  Phase diagram of a semiflexible polymer chain in a θ solvent: Application to protein folding , 1995, cond-mat/9512058.

[24]  Gerald L. Thompson,et al.  A successful algorithm for the undirected Hamiltonian path problem , 1985, Discret. Appl. Math..