The Hidden Algorithm of Ore's Theorem on Hamiltonian Cycles

The Hidden Algorithm of Ore's Theorem on Hamiltonian Cycles

In 1960, Ore found a simple sufficient condition for a graph to have a Hamiltonian cycle. We expose a heuristic algorithm, hidden in Ore's proof, which can be very effective in actually finding such a cycle. This algorithm is always reasonably efficient and suggests an easy proof that almost al...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computers & mathematics with applications (1987) 1997-12, Vol.34 (11), p.113-119
1. Verfasser: Palmer, E.M.
Format: Artikel
Sprache:eng
Schlagworte:
Graph algorithm
Hamiltonian
Probability
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In 1960, Ore found a simple sufficient condition for a graph to have a Hamiltonian cycle. We expose a heuristic algorithm, hidden in Ore's proof, which can be very effective in actually finding such a cycle. This algorithm is always reasonably efficient and suggests an easy proof that almost all graphs are Hamiltonian.
ISSN:0898-1221
1873-7668
DOI:10.1016/S0898-1221(97)00225-3