MeesterDaan (talk  contribs) 
MeesterDaan (talk  contribs) m (MeesterDaan moved page CheesemanReplication to A Predictive Data Analytic for the Hardness of Hamiltonian Cycle Problem Instances) 
(No difference)

Revision as of 15:19, 26 November 2018
This is a temporary redirection page associated with a replication study of Van Horn et al for review transparency. We're currently finishing the paper.
Interative Graphs
The interactive graphs for Hamiltonian cycles can be found here.
Source Data for Interative Graphs
Cheeseman's algorithm on 16 nodes graphs: [1]
Average and median computational costs: [2]
Cheeseman's algorithm on 24 node graphs: [3]
Average and median computational costs: [4]
Van Horn's algorithm on 16 node graphs: [5]
Average and median computational costs: [6]
Van Horn's algorithm on 24 node graphs: [7]
Average and median computational costs: [8]
Vandegriend and Culberson's algorithm on 16 node graphs: [9]
Average and median computational costs: [10]
Vandegriend and Culberson's algorithm on 24 node graphs: [11]
Average and median computational costs [12]
Source Code for the algorithms
And here is the source code of the algorithms.