✦ LIBER ✦

Deterministic “Snakes and Ladders” Heuristic for the Hamiltonian cycle problem

✍ Scribed by Baniasadi, Pouya; Ejov, Vladimir; Filar, Jerzy A.; Haythorpe, Michael; Rossomakhine, Serguei

Book ID: 121541384
Publisher: Springer-Verlag
Year: 2013
Tongue: English
Weight: 662 KB
Volume: 6
Category: Article
ISSN: 1867-2949
DOI: 10.1007/s12532-013-0059-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Interior Point Heuristic for the Hami

An Interior Point Heuristic for the Hamiltonian Cycle Problem via Markov Decision Processes

✍ Vladimir Ejov; Jerzy Filar; Jacek Gondzio 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 143 KB

A polynomial algorithm for the Hamiltoni

A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs

✍ Bang-Jensen, J�rgen; Gutin, Gregory; Yeo, Anders 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 382 KB 👁 2 views

We describe a polynomial algorithm for the Hamiltonian cycle problem for semicomplete multipartite digraphs. The existence of such an algorithm was conjectured in G.

Linear-time certifying algorithms for th

Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs

✍ Ruo-Wei Hung; Maw-Shang Chang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 252 KB

A certifying algorithm for a problem is an algorithm that provides a certificate with each answer that it produces. The certificate is an evidence that can be used to authenticate the correctness of the answer. A Hamiltonian cycle in a graph is a simple cycle in which each vertex of the graph appear