An effective crossing minimisation heuristic based on star insertion

15 Feb 2019 Clancy Kieran Haythorpe Michael Newcombe Alex

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 the combinatorial embedding is fixed, and has several desirable characteristics for practical use... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMBINATORICS
  • DISCRETE MATHEMATICS