Crossing minimisation Heuristics for 2-page drawings

The minimisation of edge crossings in a book drawing of a graph G is one of important goals for a linear VLSI design, and the two-page crossing number of a graph G provides an upper bound for the standard planar crossing number. We propose several new heuristics for the 2-page drawing problem and te...

Full description

Bibliographic Details

Main Authors:	Hongmei He, Ondrej Sykora, Imrich Vrt'o
Format:	Default Article
Published:	2005
Subjects:	Theory of computation not elsewhere classified Other information and computing sciences not elsewhere classified 1-page crossing number 2-page crossing number 2-page drawing book crossing number Hamiltonian cycle Computation Theory and Mathematics Information and Computing Sciences not elsewhere classified
Online Access:	https://hdl.handle.net/2134/2380
Tags:	Add Tag No Tags, Be the first to tag this record!