A light-based device for solving the hamiltonian path problem

Authors:
Mihai Oltean
Affiliations:
Department of Computer Science, Faculty of Mathematics and Computer Science, Babeş-Bolyai University, Cluj-Napoca, Romania
Venue:
UC'06 Proceedings of the 5th international conference on Unconventional Computation
Year:
2006

Citing 4
Cited 8

Introduction to algorithms

Introduction to algorithms
Molecular computation of solutions to combinatorial problems

Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The silicon solution [silicon photonics]

IEEE Spectrum

Ultrafast Digital-Optical Arithmetic Using Wave-Optical Computing

OSC '08 Proceedings of the 1st international workshop on Optical SuperComputing
Solving NP-Complete Problems with Delayed Signals: An Overview of Current Research Directions

OSC '08 Proceedings of the 1st international workshop on Optical SuperComputing
Light-based string matching

Natural Computing: an international journal
Solving the subset-sum problem with a light-based device

Natural Computing: an international journal
Optical Designs for Non-deterministic Turing Machines

OSC '09 Proceedings of the 2nd International Workshop on Optical SuperComputing
Evolutionary Design of Graph-Based Structures for Optical Computing

OSC '09 Proceedings of the 2nd International Workshop on Optical SuperComputing
An optical solution for the SAT Problem

OSC'10 Proceedings of the Third international conference on Optical supercomputing
Nanotechnology based optical solution for NP-hard problems

OSC'10 Proceedings of the Third international conference on Optical supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we suggest the use of light for performing useful computations. Namely, we propose a special device which uses light rays for solving the Hamiltonian path problem on a directed graph. The device has a graph-like representation and the light is traversing it following the routes given by the connections between nodes. In each node the rays are uniquely marked so that they can be easily identified. At the destination node we will search only for particular rays that have passed only once through each node. We show that the proposed device can solve small and medium instances of the problem in reasonable time.