A Light-Based Device for Solving the Hamiltonian Path Problem

  • Mihai Oltean
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4135)


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.


Destination Node Delay System Hamiltonian Path Label System Start Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Adleman, L.: Molecular computation of solutions to combinatorial problems. Science 266, 1021–1024 (1994)CrossRefGoogle Scholar
  2. 2.
    Agrawal, G.P.: Fiber-optic communication systems, 3rd edn. Wiley-Interscience, Chichester (2002)CrossRefGoogle Scholar
  3. 3.
    Ascheuer, N.: Hamiltonian path problems in the on-line optimization of flexible manufacturing systems. PhD thesis, TU Berlin (1995)Google Scholar
  4. 4.
    Černý, V.: Quantum computers and intractable (NP-Complete) computing problems. Phys. Rev. A 48, 116–119 (1993)CrossRefGoogle Scholar
  5. 5.
    Cormen, T.H., Leiserson, C.E., Rivest, R.R.: Introduction to algorithms. MIT Press, Cambridge (1990)zbMATHGoogle Scholar
  6. 6.
    Doniach, S., Garel, H., Orland, H.: Phase diagram of a semiflexible polymer chain in a θ solvent: Application to protein folding. Journal of Chemical Physics 105, 1601–1608 (1996)CrossRefGoogle Scholar
  7. 7.
    Faist, J.: Optoelectronics: silicon. Shines on Nature 433, 691–692 (2005)CrossRefGoogle Scholar
  8. 8.
    Flyckt, S.O., Marmonier, C.: Photomultiplier Tubes: Principles and Applications, Photonis, Brive, France (2002)Google Scholar
  9. 9.
    Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to NP-Completeness. Freeman & Co. San Francisco (1979)zbMATHGoogle Scholar
  10. 10.
    Greenwood, G.W.: Finding solutions to NP problems: Philosophical differences between quantum and evolutionary search algorithms. In: Proceedings CEC 2001, pp. 815–822 (2001)Google Scholar
  11. 11.
    Hartmanis, J.: On the weight of computations. Bulletin of the EATCS 55, 136–138 (1995)zbMATHGoogle Scholar
  12. 12.
    Hau, L.V., et al.: Light speed reduction to 17 meters per second in an ultracold atomic gas. Nature 397, 594–598 (1999)CrossRefGoogle Scholar
  13. 13.
    Lenslet website,
  14. 14.
    Liu, C., et al.: Observation of coherent optical information storage in an atomic medium using halted light pulses. Nature 409, 490–493 (2001)CrossRefGoogle Scholar
  15. 15.
    MacQueen, J.: Some methods for classification and analysis of multivariate observations. In: LeCam, L.M., Neyman, J. (eds.) Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, pp. 281–297. University of California press, Berkeley (1967)Google Scholar
  16. 16.
    Paniccia, M., Koehl, S.: The silicon solution. IEEE Spectrum (2005)Google Scholar
  17. 17.
    Rong, H., et al.: A continuous-wave Raman silicon laser. Nature 433, 725–728 (2005)CrossRefGoogle Scholar
  18. 18.
    Rong, H., et al.: An all-silicon Raman laser. Nature 433, 292–294 (2005)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Mihai Oltean
    • 1
  1. 1.Department of Computer Science, Faculty of Mathematics and Computer ScienceBabeş-Bolyai UniversityCluj-NapocaRomania

Personalised recommendations