Leftist canonical ordering

Authors:
Melanie Badent;Michael Baur;Ulrik Brandes;Sabine Cornelsen
Affiliations:
Department of Computer & Information Science, University of Konstanz;Department of Computer Science, Universität Karlsruhe (TH);Department of Computer & Information Science, University of Konstanz;Department of Computer & Information Science, University of Konstanz
Venue:
GD'09 Proceedings of the 17th international conference on Graph Drawing
Year:
2009

Citing 21
Cited 0

Small sets supporting fary embeddings of planar graphs

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A linear-time algorithm for drawing a planar graph on a grid

Information Processing Letters
Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems

Theoretical Computer Science
Drawing planar partitions I: LL-drawings and LH-drawings

Proceedings of the fourteenth annual symposium on Computational geometry
Embedding planar graphs on the grid

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
On Floor-Plan of Plane Graphs

SIAM Journal on Computing
Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings

SIAM Journal on Discrete Mathematics
A framework for drawing planar graphs with curves and polylines

Journal of Algorithms
Orderly spanning trees with applications to graph encoding and graph drawing

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
2-Visibility Drawings of Planar Graphs

GD '96 Proceedings of the Symposium on Graph Drawing
Planar Polyline Drawings with Good Angular Resolution

GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Regular Orientations, Arboricity, and Augmentation

GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Linear Algorithms for a k-partition Problem of Planar Graphs without Specifying Bases

WG '98 Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science
Area-Efficient Static and Incremental Graph Drawings

ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
Curve-constrained drawings of planar graphs

Computational Geometry: Theory and Applications
Radial drawings of graphs: Geometric constraints and trade-offs

Journal of Discrete Algorithms
Succinct representation of labeled graphs

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Really straight graph drawings

GD'04 Proceedings of the 12th international conference on Graph Drawing
Simultaneous embedding of planar graphs with few bends

GD'04 Proceedings of the 12th international conference on Graph Drawing
Minimum-width grid drawings of plane graphs

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.