A new light-based solution to the Hamiltonian path problem

Future Generation Computer Systems

Volumn 29, Issue 2, 2013, Pages 520-527

  Sartakhti, Javad Salimi ^a   Jalili, Saeed ^a   Rudi, Ali Gholami ^a  

^a TARBIAT MODARES UNIVERSITY   (Iran)

Author keywords

Hamiltonian path; Light based computing; NP complete problem; Optical computing; Unconventional computing

Indexed keywords

CONVENTIONAL COMPUTERS; EXPONENTIAL RUNNING TIME; GRAPH-BASED; HAMILTONIAN PATH; HAMILTONIAN PATH PROBLEMS; LIGHT-BASED COMPUTING; POLYNOMIAL PREPROCESSING; POLYNOMIAL-TIME; SOLUTION SPACE; UNCONVENTIONAL COMPUTING;

COMPUTATIONAL COMPLEXITY; OPTICAL DATA PROCESSING; POLYNOMIAL APPROXIMATION;

HAMILTONIANS;

EID: 84868243676     PISSN: 0167739X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.future.2012.07.008     Document Type: Article

References (27)

1. S. Arora Polynomial time approximation schemes for Euclidian traveling salesman and other geometric problems Journal of the ACM 45 5 1998 753 782
2. G.L. Thompson, and S. Singhal A successful algorithm for the undirected Hamiltonian path problem Future Generation Computer Systems 10 2 1985 179 195
3. T.D. Kieu Quantum algorithm for Hilbert's tenth problem International Journal of Theoretical Physics 42 2003 1461 1478
4. L. Adleman Molecular computation of solutions to combinatorial problems Science 266 1994 1021 1024
5. S. Aaronson, Np-complete problems and physical reality, ACM SIGACT News, Complexity Theory Column, ECCC TR05-026, 2005.
6. A. Vergis, K. Steiglitz, and B. Dickinson The complexity grave of analog computation Mathematics and Computers in Simulation 28 1996 91 113
7. W.L. Changa, and M. Guob Towards solution of the set-splitting problem on gel-based DNA computing Future Generation Computer Systems 20 5 2004 875 885
8. A. Zomayaa, F. Ercalb, and S. Olariu Parallel computing problems and nature-inspired solutions Future Generation Computer Systems 17 4 2001 5 7
9. L. Kari DNA computing in vitro and in vivo? Future Generation Computer Systems 17 7 2001 823 834
10. T. Yatagai Optical computing in Japan Future Generation Computer Systems 4 3 1988 177 187
11. http://www.en.wikipedia.org/wiki/opticalcharacterrecognition, latest access 2011.
12. J.W. Goodman Architectural development of optical data processing systems Australian Journal of Electrical and Electronics Engineering 2 1982 139 149
13. J.H. Reif, and A. Tyagi Efficient parallel algorithms for optical computing with the discrete Fourier transform primitive Applied Optics 36 29 1997 7327 7340
14. J. Faist Optoelectronics: silicon shines on Nature 433 2005 691 692
15. S. Dolev, and H. Fitoussi Masking traveling beams: optical solutions for NP-complete problems, trading space for time Theoretical Computer Science 411 2010 837 853
16. S. Goliaei, and S. Jalili An optical wavelength-based solution to the 3-SAT problem Lecture Notes in Computer Science 5882 2009 77 85
17. M. Oltean, and O. Muntean Exact cover with light New Generation Computing 26 4 2008 327 344 Springer-Verlag
18. M. Oltean Solving the Hamiltonian path problem with a light-based computer Natural Computing: An International Journal 7 1 2008 57 70
19. M. Oltean, and O. Muntean Solving the subset-sum problem with a light-based device Natural Computing, An International Journal 8 2 2009 321 331
20. M. Hasan, S. Hossain, M.M. Rahman, and M.S. Rahman Solving the generalized subset sum problem with a light based device Natural Computing 10 2011 541 550
21. B.S. Wherrett, S. Desmond Smith, F.A.P. Tooley, and A.C. Walker Optical components for digital optical circuits Future Generation Computer Systems 3 4 1987 253 259
22. C. Katsinis Merging, sorting and matrix operations on the SOME-Bus multiprocessor architecture Future Generation Computer Systems 20 4 2004 643 661
23. M.R. Garey, and D.S. Johnson Computer and Intractability 1979 Freeman San Fransisco, CA
24. D. Angluin, and L. Valiant Probabilistic algorithms for Hamiltonian circuits and matchings Journal of Computer and System Sciences 18 2 1979 155 190
25. J.P. Norback, and R.F. Love Heuristic for the Hamiltonian path problem in euclidian two space Journal of the Operational Research Society 30 4 1979 363 368
26. F. Rubin A search procedure for Hamiltonian paths and circuits Journal of the ACM 21 4 1974 576 580
27. H.J. Levinson Proximity X-ray Lithography 2005 SPIE Press Bellingham, WA Available: http://spie.org/x33182.xml (latest access: 12-14-2011)