Leftist Canonical Ordering

Canonical ordering is an important tool in planar graph drawing and other applications. Although a linear-time algorithm to determine canonical orderings has been known for a while, it is rather complicated to understand and implement, and the output is not uniquely determined. We present a new approach that is simpler and more intuitive, and that computes a newly defined leftist canonical ordering of a triconnected graph which is a uniquely determined leftmost canonical ordering.

• Type: Conference
• Year: 2009
• Where: GD
• Authors: Melanie Badent, Michael Baur, Ulrik Brandes, Sabine Cornelsen
• Keywords: Canonical Ordering, Computer Graphics, GD 2009, Leftist Canonical Ordering, Planar Graph Drawing