Results and Datasets: An Improved Backtracking Algorithm for the Hamiltonian Cycle Problem

Dataset for "An Improved Backtracking Algorithm for the Hamiltonian Cycle Problem" (paper forthcoming) Description: This dataset contains 7,198,292 randomly generated graph instances used to evaluate the Jingle algorithm against the Vandegriend and Culberson algorithm for the Hamiltonian cycle problem across graph sizes (V = 24, 32, 40, 48). Keep in mind that the datasets use a bespoke binary encoding and require the following repo to read them https://github.com/Joeri1324/graph-generation Datasets: 24.bin 32.bin 40.bin 48.bin Result sets: result-vacul-24.json result-vacul-32.json result-vacul-40.json result-vacul-48.json result-jingle-24.json result-jingle-32.json result-jingle-40.json result-jingle-48.json Instance set sizes: V = 24: 1,199,964 instances V = 32: 1,599,843 instances V = 40: 1,999,360 instances V = 48: 2,399,125 instances Each edge count has an equal number of instances. Graphs were generated by starting from an empty graph and randomly adding edges until the target count was reached.