Natural Computing

, Volume 7, Issue 1, pp 57–70 | Cite as

Solving the Hamiltonian path problem with a light-based computer

  • Mihai Oltean


In this paper 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 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.


Light-based computing NP-complete Hamiltonian path 



The author likes to thanks to the anonymous reviewers and to the participants to Unconventional Computing 2006 conference (specially to Mikhail Prokopenko, Damien Woods, Jerzy Górecki, Alexis De Vos, Russ Abbott, William Langdon, Pierluigi Frisco) for providing useful suggestions on an earlier version of this paper (Oltean 2006).


  1. Adleman L (1994) Molecular computation of solutions to combinatorial problems. Science 266:1021–1024CrossRefGoogle Scholar
  2. Ascheuer N (1995) Hamiltonian path problems in the on-line optimization of flexible manufacturing systems. PhD thesis, TU BerlinGoogle Scholar
  3. Bajcsy M, Zibrov AS, Lukin MD (2003) Stationary pulses of light in an atomic medium. Nature 426:638–641CrossRefGoogle Scholar
  4. Černý V (1993) Quantum computers and intractable (NP-Complete) computing problems. Phys Rev A 48:116–119CrossRefGoogle Scholar
  5. Cormen TH, Leiserson CE, Rivest RR (1990) Introduction to algorithms. MIT PressGoogle Scholar
  6. Doniach S, Garel H, Orland H, (1996) Phase diagram of a semiflexible polymer chain in a θ solvent: application to protein folding. J Chem Phys 105:1601–1608CrossRefGoogle Scholar
  7. Faist J (2005) Optoelectronics: silicon shines on. Nature 433:691–692CrossRefGoogle Scholar
  8. Feitelson DG (1988) Optical computing: A survey for computer scientists. MIT PressGoogle Scholar
  9. Flyckt SO, Marmonier C (2002) Photomultiplier tubes: principles and applications. Photonis, Brive, FranceGoogle Scholar
  10. Garey MR, Johnson DS (1979) Computers and intractability: a guide to NP-completeness. Freeman & Co, San Francisco, CAMATHGoogle Scholar
  11. Goodman JW (1982) Architectural development of optical data processing systems. Aust J Electr Electron Eng 2:139–149Google Scholar
  12. Greenwood GW (2001) Finding solutions to NP problems: philosophical differences between quantum and evolutionary search algorithms. In: Proceedings CEC’2001, IEEE Press, pp 815–822Google Scholar
  13. Hartmanis J (1995) On the weight of computations. Bull EATCS 55:136–138MATHGoogle Scholar
  14. Hau LV, Harris SE, Dutton Z, Behroozi CH (1999) Light speed reduction to 17 meters per second in an ultracold atomic gas. Nature 397:594–598CrossRefGoogle Scholar
  15. Henkel C, Frisco P, Tengely Sz (2005) An algorithm for SAT without an extraction phase. DNA Computing, Eleventh International Meeting on DNA Based Computers, LNCS 3892, pp 67–80Google Scholar
  16. Lenslet (2004) website,
  17. Liu C, Dutton Z, Behroozi CH, Hau LV (2001) Observation of coherent optical information storage in an atomic medium using halted light pulses. Nature 409:490–493CrossRefGoogle Scholar
  18. MacQueen J (1967) Some methods for classification and analysis of multivariate observations. In: LeCam LM, Neyman J (eds) Proceedings of the fifth Berkeley symposium on mathematical statistics and probability. University of California press, Berkeley, pp 281–297Google Scholar
  19. Murphy N, Naughton TJ, Woods D, Henley B, McDermott K, Duffy E, van der Burgt PJM, Woods N (2006) Implementations of a model of physical sorting. In: Adamatzky A, Teuscher C (eds) From Utopian to Genuine Unconventional Computers workshop. Luniver Press, pp 79–100Google Scholar
  20. Naughton TJ (2000) A model of computation for Fourier optical processors. In: Lessard RA, Galstian T (eds) Optics in Computing, Proc. SPIE 4089:24–34Google Scholar
  21. Oltean M (2006) A light-based device for solving the Hamiltonian path problem. In: Calude C et al (eds) Unconventional computing. LNCS 4135, Springer-Verlag, pp 217–227Google Scholar
  22. Paniccia M, Koehl S (2005) The silicon solution. IEEE Spectrum, IEEE Press, OctoberGoogle Scholar
  23. Reif JH, Tyagi A (1997) Efficient parallel algorithms for optical computing with the discrete Fourier transform primitive. Appl Optics 36(29):7327–7340CrossRefGoogle Scholar
  24. Rong H, Jones R, Liu A, Cohen O, Hak D, Fang A, Paniccia M (2005a) A continuous-wave Raman silicon laser. Nature 433:725–728CrossRefGoogle Scholar
  25. Rong H, Liu A, Jones R, Cohen O, Hak D, Nicolaescu R, Fang A, Paniccia M (2005b) An all-silicon Raman laser. Nature 433:292–294CrossRefGoogle Scholar
  26. Schultes D (2005) Rainbow sort: sorting at the speed of light. Nat Comput Springer-Verlag 5(1):67–82CrossRefMathSciNetGoogle Scholar
  27. Woods D, Naughton TJ (2005) An optical model of computation. Theor Comput Sci 334(1–3):227–258MATHCrossRefMathSciNetGoogle Scholar
  28. Sloane N (2006) The on-line encyclopedia of integer sequences.∼njas/sequences/A023758
  29. Optical Character Recognition (2006) @ Wikipedia,

Copyright information

© Springer Science+Business Media, Inc. 2007

Authors and Affiliations

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

Personalised recommendations