𝔖 Bobbio Scriptorium
✦   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

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Linear-time certifying algorithms for th
✍ 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