Hamiltonian path problem

Known as: Directed Hamiltonian cycle problem, Hamilton path problem, Hamiltonian cycle problem 
In the mathematical field of graph theory the Hamiltonian path problem and the Hamiltonian cycle problem are problems of determining whether a… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1977-2017
0102019772017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Dynamic Programming hardly requires introduction. Since the term was in introduced by Richard Bellman in 1940’s it has countless… (More)
  • figure 1
  • figure 2
Is this relevant?
2012
2012
In this paper, we consider the Hamiltonian alternating path problem for graphs, multigraphs, and digraphs. We describe an… (More)
  • table I
  • table II
  • table III
  • table VI
  • table VII
Is this relevant?
2011
2011
In this article, we present the first approximation algorithm for a routing problem that is frequently encountered in the motion… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
In this paper we propose a special computational device which uses light rays for solving the Hamiltonian path problem on a… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
2006
2006
In this paper we suggest the use of light for performing useful computations. Namely, we propose a special device which uses… (More)
  • table 1
  • figure 1
Is this relevant?
2005
2005
This paper deals with the problem of constructing Hamiltonian paths of optimal weight, called HPPs;t if the two endpoints are… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
The Hamiltonian path problem is one of the famous hard combinatorial problems. We provide the first molecular-scale autonomous… (More)
Is this relevant?
1998
1998
We describe a polynomial algorithm for the Hamiltonian cycle problem for semicomplete multipartite digraphs. The existence of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1987
Highly Cited
1987
One way to cope with an NP-hard problem is to find an algorithm that is fact on average with respect to a natural probability… (More)
  • figure 2
  • figure 3
Is this relevant?
1985
1985
In this piper a polynomial algorithm called the Minram algorithm is presented which finds a Hamiltonian Path in in undirected… (More)
  • figure 2.1
  • figure 8.1
Is this relevant?