Data Structures and Algorithms

   

Hamiltonian Paths in Graphs

Authors: Atul Mehta

In this paper, we explore the connections between graphs and Turing machines. A method to construct Turing machines from a general undirected graph is provided. Determining whether a Hamiltonian cycle does exist is now shown to be equivalent to solving the halting problem. A modified version of Turing machines is now developed to solve certain classes of computational problems.

Comments: 5 Pages.

Download: PDF

Submission history

[v1] 2016-08-23 03:30:25
[v2] 2016-11-27 23:50:46
[v3] 2016-12-03 19:20:21

Unique-IP document downloads: 407 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus