Abstract
The exponential running time for algorithms designed to solve NP-complete problems in conventional computers, mostly, makes it almost impossible solving large instances of such problems in reasonable time. Unconventional computers may be the answer to this problem. In this paper we use light to solve a Hamiltonian path problem in polynomial time. At first, the solution space of the problem is generated and then invalid solutions are eliminated from it. Our approach is based on filters which remove paths that are not Hamiltonian from the set of possible solutions. We perform polynomial preprocessing steps to produce the filters and find Hamiltonian paths of a graph based on the rays of light passing through them. Finally we report the design of filters and use light to solve the Hamiltonian path problem.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
