In the mathematical field of graph theory the Hamiltonian path problem and the Hamiltonian cycle problem are problems of determining whether aâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2013

2013

- Dmitriy Nuriyev
- ArXiv
- 2013

Dynamic Programming hardly requires introduction. Since the term was in introduced by Richard Bellman in 1940â€™s it has countlessâ€¦Â (More)

Is this relevant?

2012

2012

- Anna Gorbenko, Vladimir Popov
- 2012

In this paper, we consider the Hamiltonian alternating path problem for graphs, multigraphs, and digraphs. We describe anâ€¦Â (More)

Is this relevant?

2011

2011

- Sravanthi Yadlapalli, Jungyun Bae, S Nataraja Rathinam, Srikanth Darbha
- Proceedings of the 2011 American Controlâ€¦
- 2011

In this article, we present the first approximation algorithm for a routing problem that is frequently encountered in the motionâ€¦Â (More)

Is this relevant?

2007

2007

- Mihai Oltean
- Natural Computing
- 2007

In this paper we propose a special computational device which uses light rays for solving the Hamiltonian path problem on aâ€¦Â (More)

Is this relevant?

2006

2006

- Mihai Oltean
- UC
- 2006

In this paper we suggest the use of light for performing useful computations. Namely, we propose a special device which usesâ€¦Â (More)

Is this relevant?

2005

2005

- JÃ©rÃ´me Monnot
- European Journal of Operational Research
- 2005

This paper deals with the problem of constructing Hamiltonian paths of optimal weight, called HPPs;t if the two endpoints areâ€¦Â (More)

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

- JÃ¸rgen Bang-Jensen, Gregory Gutin, Anders Yeo
- Journal of Graph Theory
- 1998

We describe a polynomial algorithm for the Hamiltonian cycle problem for semicomplete multipartite digraphs. The existence ofâ€¦Â (More)

Is this relevant?

Highly Cited

1987

Highly Cited

1987

- Yuri Gurevich, Saharon Shelah
- SIAM J. Comput.
- 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)

Is this relevant?

1985

1985

- Gerald L. Thompson, Sharad Singhal
- Discrete Applied Mathematics
- 1985

In this piper a polynomial algorithm called the Minram algorithm is presented which finds a Hamiltonian Path in in undirectedâ€¦Â (More)

Is this relevant?