5 citations · 5 across the 18 of their papers we have counts for
3 papers · 1 filter
A new benchmark set for Traveling salesman problem and Hamiltonian cycle problem
Pouya Baniasadi, Vladimir Ejov, Michael Haythorpe +1
We present a benchmark set for Traveling salesman problem (TSP) with characteristics that are different from the existing benchmark sets. In particular, we focus on small instances…
There are no Cubic Graphs on 26 Vertices with Crossing Number 10 or 11
Kieran Clancy, Michael Haythorpe, Alex Newcombe +1
We show that no cubic graphs of order 26 have crossing number larger than 9, which proves a conjecture of Ed Pegg Jr and Geoffrey Exoo that the smallest cubic graphs with crossing…
An effective crossing minimisation heuristic based on star insertion
Kieran Clancy, Michael Haythorpe, Alex Newcombe
We present a new heuristic method for minimising crossings in a graph. The method is based upon repeatedly solving the so-called {\em star insertion problem} in the setting where t…