Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

27

CORR
2007
Springer

favoriteEmaildiscussreport

93views Education» more CORR 2007»

Solving the Hamiltonian path problem with a light-based computer

13 years 10 months ago

Solving the Hamiltonian path problem with a light-based computer

Download www.cs.ubbcluj.ro

Abstract. In this paper we suggest the use of light for performing useful computations. Namely, we propose a special computational 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 by following the routes given by the connections between nodes. In each node the rays are uniquely marked so that they can be easily identiﬁed. 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.

Mihai Oltean

Real-time Traffic

CORR 2007 | Education | Hamiltonian Path Problem | Light Rays | Special Computational Device |

claim paper

Related Content

» A LightBased Device for Solving the Hamiltonian Path Problem

» Metaheuristics for the Asymmetric Hamiltonian Path Problem

» On Computing Longest Paths in Small Graph Classes

» The Longest Path Problem Is Polynomial on Interval Graphs

» DNA Computing for Complex Scheduling Problem

» Timevarying path following control for portHamiltonian systems

» Using FPGAs to solve the Hamiltonian cycle problem

» Solving 3CNFSAT and HPP in Linear Time Using WWW

» Solutions to Computational Problems Through Gene Assembly

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	CORR
Authors	Mihai Oltean

Comments (0)