An efficient heuristic for crossing minimisation and its applications

Author: Alex Newcombe

Newcombe, Alexander, 2019 An efficient heuristic for crossing minimisation and its applications, Flinders University, College of Science and Engineering

Terms of Use: This electronic version is (or will be) made publicly available by Flinders University in accordance with its open access policy for student theses. Copyright in this thesis remains with the author. You may use this material for uses permitted under the Copyright Act 1968. If you are the owner of any included third party copyright material and/or you believe that any material has been made available without permission of the copyright owner please contact copyright@flinders.edu.au with the details.

Abstract

This thesis aims to provide a broad study of the crossing number problem. In particular, we describe a new heuristic for crossing minimisation, and demonstrate that it performs comparably to the state of the art existing heuristics. We then take advantage of the new heuristic to help in developing various new results and conjectures related to crossing numbers.

Keywords: graph drawing,crossing number,graph algorithms,graph theory,crossing minimization

Subject: Computer Science thesis

Thesis type: Doctor of Philosophy
Completed: 2019
School: College of Science and Engineering
Supervisor: Michael Haythorpe