This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Seventh International Conference on Information Visualization (IV'03)
Planarity Testing for Graphs Represented by A Rotation Scheme
London, England
July 16-July 18
ISBN: 0-7695-1988-1
A. Donafee, University of Luton
C. Maple, University of Luton
Many algorithms exist to determine if a given graph can be embedded in a plane [4]. The majority of these methods, however, are only valid for simple graphs and do not take into account the order of edges emanating from each vertex. There are many areas, such as communication design, genetics, group theory, network optimisation and VLSI, where this ordering of edges is crucial to the representation of a system. Rotation schemes can be used to store the ordering of edges around a vertex. Let G be an arbitrary, possibly non-simple, graph. We provide an algorithm that determines, from the rotation scheme of G, if G can be embedded in the plane. If the rotation scheme of G can be realised by a planar drawing, the regions of G are returned.
Citation:
A. Donafee, C. Maple, "Planarity Testing for Graphs Represented by A Rotation Scheme," iv, pp.491, Seventh International Conference on Information Visualization (IV'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.