Loughborough University
Leicestershire, UK
LE11 3TU
+44 (0)1509 263171
Loughborough University

Loughborough University Institutional Repository

Please use this identifier to cite or link to this item: https://dspace.lboro.ac.uk/2134/2386

Title: New circular drawing algorithms
Authors: He, H.
Sykora, Ondrej
Issue Date: 2004
Citation: HE and SÝKORA, 2004. New circular drawing algorithms. IN: Proceedings of the Workshop on Information Technologies - Applications and Theory (ITAT), Slovakia, September 15-19
Abstract: 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 (outerplanar, convex, or one-page) crossing number of the graph G. This paper addresses heuristic algorithms to find an ordering of vertices to minimise the number of crossings in the corresponding circular drawing of the graph. New algorithms to find low crossing circular drawings are presented, and compared with algorithm of Makinen, CIRCULAR+ algorithm of Six and Tollis and algorithm of Baur and Brandes. We get better or comparable results to the other algorithms.
Description: This is a conference paper
URI: https://dspace.lboro.ac.uk/2134/2386
Appears in Collections:Conference Papers (Computer Science)

Files associated with this item:

File Description SizeFormat
HeSyk04.pdf232.21 kBAdobe PDFView/Open

 

SFX Query

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.