Genetic algorithms for bipartite and outerplanar graph drawings are best!

We design genetic algorithms with small populations for two basic problems of graph drawing: the one-sided bipartite drawing and the outerplanar drawing. We compare our results for the one-sided bipartite drawing problem with Penalty Minimisation (PM)[3], the best one-sided heuristic currently avail...

Full description

Bibliographic Details

Main Authors:	Hongmei He, Matthew Newton, Ondrej Sykora
Format:	Default Book
Published:	2005
Subjects:	Other information and computing sciences not elsewhere classified untagged Information and Computing Sciences not elsewhere classified
Online Access:	https://hdl.handle.net/2134/2388
Tags:	Add Tag No Tags, Be the first to tag this record!