Leftist Canonical Ordering
Badent, Melanie and Baur, Michael and Brandes, Ulrik and Cornelsen, Sabine (2010) Leftist Canonical Ordering. In: Graph Drawing 17th International Symposium, GD 2009, September 22-25, 2009, Chicago, IL, USA , pp. 159-170 (Official URL: http://dx.doi.org/10.1007/978-3-642-11805-0_16).
Full text not available from this repository.
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 deﬁned leftist canonical ordering of a triconnected graph which is a uniquely determined leftmost canonical ordering.
Repository Staff Only: item control page