Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,833,793 papers from all fields of science
Search
Sign In
Create Free Account
Hamiltonian path problem
Known as:
Directed Hamiltonian cycle problem
, DHCP (disambiguation)
, Hamilton path problem
Expand
In the mathematical field of graph theory the Hamiltonian path problem and the Hamiltonian cycle problem are problems of determining whether a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
33 relations
Average-case complexity
Barnette's conjecture
Cograph
Complexity class
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Expansion of Gene Clusters and the Shortest Hamiltonian Path Problem
Sonja J. Prohaska
,
Christian Höner zu
,
Siderdissen
,
P. Stadler
2016
Corpus ID: 465675
very abstract, this abstract Insert your abstract here. Include keywords, PACS and mathematical subject classification numbers as…
Expand
2014
2014
An investigation of the role of DNA as molecular computers: A computational study on the Hamiltonian path problem
A. Heidari
2014
Corpus ID: 212480779
— The ability of silicon to make faster computer chips ends soon. Thus, scientists have introduced DNA as a proper and clean…
Expand
2011
2011
Graph Decomposition for Memoryless Periodic Exploration
Adrian Kosowski
,
A. Navarra
Algorithmica
2011
Corpus ID: 253971587
We consider a general framework in which a memoryless robot periodically explores all the nodes of a connected anonymous graph by…
Expand
2008
2008
A Type of Variation of Hamilton Path Problem with Applications
Jitian Xiao
,
Jun Wang
International Conference for Young Computer…
2008
Corpus ID: 8896101
This paper describes a type of variation of the Hamilton path problem that can be applied to a type of applications. Unlike the…
Expand
2007
2007
A Genetic Algorithm Based on Stochastic Crossover for DHCP
M. Carpentieri
IEEE Symposium on Foundations of Computational…
2007
Corpus ID: 5812301
We introduce a genetic model based on stochastic crossover to solve the Hamiltonian cycle problem (DHCP) for random digraphs…
Expand
2002
2002
DNA Algorithm to the Directed Shortest Hamilton Path Problem
Gao Lin
2002
Corpus ID: 124426750
DNA computing is a novel method of computing and biochemistry. The DNA algorithm to the directed shortest Hamilton path problem…
Expand
2000
2000
3D DNA PATTERNS AND COMPUTATION
N. Jonoska
2000
Corpus ID: 63887397
We propose use of three dimensional graph structures for solving computational problems with DNA molecules. Building blocks of k…
Expand
1998
1998
Subtree overlap graphs and the maximum independent set problem
E. Cenek
1998
Corpus ID: 125360202
A graph G is a subtree overlap graph if there exists a tree T and a set of subtrees fTig so that there exists a one-to-one…
Expand
1995
1995
Hamiltonian Cycle Problem for Triangle GraphsU
M. Krishnamoorthy
1995
Corpus ID: 17153705
We show that the Hamiltonian cycle problem is NP-complete for a class of planar graphs named triangle graphs that are closely…
Expand
1993
1993
Hamiltonicity in Graphs with Few P4s Hamiltonicity in Graphs with Few P 4 S Hamiltonicity in Graphen Mit Wenig P 4 's
W. Hochstt
,
G. Tinhofer
,
W. Hochstt
,
W. Hochstt Attler
,
Vor Kurzem
,
Haben R Jamison
1993
Corpus ID: 17010773
Zusammenfassung Hamiltonicity in graphs with few P 4 's. In a recent series of articles R. Jamison and S. Olariu developed…
Expand