Algorithms for book crossing number problems
thesisposted on 11.09.2018, 15:37 by Hongmei He
The 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.]
EPSRC (grant no.: GR/S76694/01).
- Computer Science