Computer Science – Data Structures and Algorithms
Scientific paper
2001-02-07
Computer Science
Data Structures and Algorithms
25 pages, 7 figures, A preliminary version appeared in Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithm
Scientific paper
We introduce and study the {\em orderly spanning trees} of plane graphs. This algorithmic tool generalizes {\em canonical orderings}, which exist only for triconnected plane graphs. Although not every plane graph admits an orderly spanning tree, we provide an algorithm to compute an {\em orderly pair} for any connected planar graph $G$, consisting of a plane graph $H$ of $G$, and an orderly spanning tree of $H$. We also present several applications of orderly spanning trees: (1) a new constructive proof for Schnyder's Realizer Theorem, (2) the first area-optimal 2-visibility drawing of $G$, and (3) the best known encodings of $G$ with O(1)-time query support. All algorithms in this paper run in linear time.
Chiang Yi-Ting
Lin Ching-Chi
Lu Hsueh-I
No associations
LandOfFree
Orderly Spanning Trees with Applications does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Orderly Spanning Trees with Applications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Orderly Spanning Trees with Applications will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-461536