New circular drawing algorithms

In the circular (other alternate concepts are outerplanar, convex and one-page) drawing one places vertices of a n-vertex m-edge connected graph G along a circle, and the edges are drawn as straight lines. The smallest possible number of crossings in such a drawing of the graph G is called circular...

Full description

Bibliographic Details

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