Finding a Minimum-depth Embedding of a Planar Graph in O(n 4) Time
- 120 Downloads
Consider an n-vertex planar graph G. The depth of an embedding Γ of G is the maximum distance of its internal faces from the external one. Several researchers pointed out that the quality of a planar embedding can be measured in terms of its depth. We present an O(n 4)-time algorithm for computing an embedding of G with minimum depth. This bound improves on the best previous bound by an O(nlog n) factor. As a side effect, our algorithm improves the bounds of several algorithms that require the computation of a minimum-depth embedding.
Unable to display preview. Download preview PDF.
- 6.Dolev, D., Leighton, F.T., Trickey, H.: Planar embedding of planar graphs. Adv. Comput. Res. 2, 147–161 (1984) Google Scholar
- 7.Kammer, F.: Determining the smallest k such that g is k-outerplanar. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA’07. LNCS, vol. 4698, pp. 359–370. Springer, Berlin (2007) Google Scholar