scholarly journals New Sufficient Conditions for Hamiltonian Paths

2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
M. Sohel Rahman ◽  
M. Kaykobad ◽  
Jesun Sahariar Firoz
Keyword(s):  
Hamiltonian Path ◽  
Sufficient Conditions ◽  
Hamiltonian Paths ◽  
Hamiltonian Path Problem

A Hamiltonian path in a graph is a path involving all the vertices of the graph. In this paper, we revisit the famous Hamiltonian path problem and present new sufficient conditions for the existence of a Hamiltonian path in a graph.

scholarly journals Hamiltonian Paths in Some Classes of Grid Graphs

2012 ◽  
Vol 2012 ◽  
pp. 1-17 ◽  
Author(s):  
Fatemeh Keshavarz-Kohjerdi ◽  
Alireza Bagheri
Keyword(s):  
Linear Time ◽  
Hamiltonian Path ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Hamiltonian Paths ◽  
Grid Graphs ◽  
Hamiltonian Path Problem ◽  
Np Complete ◽  
Necessary And Sufficient ◽  
Linear Time Algorithms

The Hamiltonian path problem for general grid graphs is known to be NP-complete. In this paper, we give necessary and sufficient conditions for the existence of Hamiltonian paths inL-alphabet,C-alphabet,F-alphabet, andE-alphabet grid graphs. We also present linear-time algorithms for finding Hamiltonian paths in these graphs.

scholarly journals A successful algorithm for the undirected Hamiltonian path problem

1985 ◽  
Vol 10 (2) ◽  
pp. 179-195 ◽  
Author(s):  
Gerald L. Thompson ◽  
Sharad Singhal
Keyword(s):  
Hamiltonian Path ◽  
Hamiltonian Path Problem

Expected Computation Time for Hamiltonian Path problem

1987 ◽  
Vol 16 (3) ◽  
pp. 486-502 ◽  
Author(s):  
Yuri Gurevich ◽  
Saharon Shelah
Keyword(s):  
Hamiltonian Path ◽  
Computation Time ◽  
Hamiltonian Path Problem

scholarly journals On Cayley Digraphs That Do Not Have Hamiltonian Paths

2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Dave Witte Morris
Keyword(s):  
Finite Group ◽  
Hamiltonian Path ◽  
Infinite Family ◽  
Hamiltonian Paths ◽  
Cayley Digraph

We construct an infinite family {Cay→(Gi;ai;bi)} of connected, 2-generated Cayley digraphs that do not have hamiltonian paths, such that the orders of the generators ai and bi are unbounded. We also prove that if G is any finite group with |[G,G]|≤3, then every connected Cayley digraph on G has a hamiltonian path (but the conclusion does not always hold when |[G,G]|=4 or 5).

3D DNA Self-Assembly Algorithmic Model to Solve the Hamiltonian Path Problem

2021 ◽  
Vol 16 (5) ◽  
pp. 731-737
Author(s):  
Jingjing Ma
Keyword(s):  
Self Assembly ◽  
Dna Computing ◽  
Computing Time ◽  
Hamiltonian Path ◽  
Experimental Methods ◽  
Deterministic Algorithm ◽  
Assembly Algorithm ◽  
Hamiltonian Path Problem ◽  
Dna Tiles ◽  
Algorithmic Model

Self-assembly reveals the innate character of DNA computing, DNA self-assembly is regarded as the best way to make DNA computing transform into computer chip. This paper introduces a strategy of DNA 3D self-assembly algorithm to solve the Hamiltonian Path Problem. Firstly, I introduced a non-deterministic algorithm. Then, according to the algorithm I designed the types of DNA tiles which the computing process needs. Lastly, I demonstrated the self-assembly process and the experimental methods which can get the final result. The computing time is linear, and the number of the different tile types is constant.

scholarly journals Solution of the knight's Hamiltonian path problem on chessboards

1994 ◽  
Vol 50 (2) ◽  
pp. 125-134 ◽  
Author(s):  
Axel Conrad ◽  
Tanja Hindrichs ◽  
Hussein Morsy ◽  
Ingo Wegener
Keyword(s):  
Hamiltonian Path ◽  
Hamiltonian Path Problem
Sign in / Sign up

Export Citation Format

Share Document