Orderly Spanning Trees with Applications to Graph Encoding and Graph Drawing (2001)
by
Yi-ting Chiang
,
Ching-Chi Lin
,
Hsueh-i Lu
| Venue: | In 12 th Symposium on Discrete Algorithms (SODA |
| Citations: | 29 - 6 self |
BibTeX
@INPROCEEDINGS{Chiang01orderlyspanning,
author = {Yi-ting Chiang and Ching-Chi Lin and Hsueh-i Lu},
title = {Orderly Spanning Trees with Applications to Graph Encoding and Graph Drawing},
booktitle = {In 12 th Symposium on Discrete Algorithms (SODA},
year = {2001},
pages = {506--515},
publisher = {ACM-SIAM}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The canonical ordering for triconnected planar graphs is a powerful method for designing graph algorithms. This paper introduces the orderly pair of connected planar graphs, which extends the concept of canonical ordering to planar graphs not required to be triconnected. Let G be a connected planar graph. We give a linear-time algorithm that obtains an orderly pair (H
