Skip to search formSkip to main contentSkip to account menu

Hamiltonian path problem

Known as: Directed Hamiltonian cycle problem, DHCP (disambiguation), Hamilton path problem 
In the mathematical field of graph theory the Hamiltonian path problem and the Hamiltonian cycle problem are problems of determining whether a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

33 relations
Average-case complexityBarnette's conjectureCographComplexity class

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Deterministic “Snakes and Ladders” Heuristic for the Hamiltonian cycle problem
We present a polynomial complexity, deterministic, heuristic for solving the Hamiltonian cycle problem (HCP) in an undirected… 
2012
2012
The Hamiltonian Alternating Path Problem
In this paper, we consider the Hamiltonian alternating path problem for graphs, multigraphs, and digraphs. We describe an… 
2011
2011
Hamiltonian index is NP-complete
2010
2010
Cycle Lengths in Hamiltonian Graphs with a Pair of Vertices Having Large Degree Sum
A graph of order n is said to be pancyclic if it contains cycles of all lengths from three to n. Let G be a Hamiltonian graph and… 
Highly Cited
2010
Highly Cited
2010
Computational complexity of tissue-like P systems
2009
2009
Approximating the Maximum Internal Spanning Tree problem
Highly Cited
2007
Highly Cited
2007
Solving the Hamiltonian path problem with a light-based computer
In this paper we propose a special computational device which uses light rays for solving the Hamiltonian path problem on a… 
Review
2007
Review
2007
Multipartite tournaments: A survey
2004
2004
Towards solution of the set-splitting problem on gel-based DNA computing
Highly Cited
1997
Highly Cited
1997
Constrained discounted Markov decision processes and Hamiltonian cycles
  • E. Feinberg
  • Proceedings of the 36th IEEE Conference on…
  • 1997
  • Corpus ID: 8897255
Establishes new links between stochastic and discrete optimization. We consider the following three problems for discrete time… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)