Sequential and parallel algorithms for low-crossing graph drawing

The one- and two-sided bipartite graph drawing problem alms to find a layout of a bipartite graph, with vertices of the two parts placed on parallel imaginary lines, that has the minimum number of edge-crossings. Vertices of one part are in fixed positions for the one-sided problem, whereas all vert...

Full description

Saved in:
Bibliographic Details
Main Author: Matthew Newton
Format: Default Thesis
Published: 2007
Subjects:
Other information and computing sciences not elsewhere classified
Graph drawing
Bipartite graphs
Biplanar graphs
Genetic algorithms
Heuristic search
Parallel computation
Information and Computing Sciences not elsewhere classified
Online Access:https://hdl.handle.net/2134/12944
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://hdl.handle.net/2134/12944

Similar Items