Thesis-2006-He.pdf (5.25 MB)
Algorithms for book crossing number problems
thesis
posted on 2018-09-11, 15:37 authored by Hongmei HeThe crossing minimisation problem is of outmost importance in the field of
graph drawings. The aesthetical properties and readability of graphs are heavily
dependent on the number of crossings in a drawing. Moreover, crossing
minimisation is the most important goal in the linear Very Large Scale Integration
(VLSI) circuit design and Quantum-dot Cellular Automata (QCA),
since smaller crossing number means lower cost. Another application is for the
problem of computing an mRNA sequence of maximal codon-wise similarity
to a given mRNA (MRSO problem) in bioinformatics computing. [Continues.]
Funding
EPSRC (grant no.: GR/S76694/01).
History
School
- Science
Department
- Computer Science
Publisher
© Hongmei HePublisher statement
This work is made available according to the conditions of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) licence. Full details of this licence are available at: https://creativecommons.org/licenses/by-nc-nd/4.0/Publication date
2006Notes
A Doctoral Thesis. Submitted in partial fulfilment of the requirements for the award of Doctor of Philosophy at Loughborough University.Language
- en