Minimum Depth Graph Embedding

Abstract. The depth of a planar embedding is a measure of the topological nesting of the biconnected components of the graph. Minimizing the depth of planar embeddings has important practical applications to graph drawing. We give a linear time algorithm for computing a minimum depth embedding of a planar graphs whose biconnected components have a prescribed embedding.

• Type: Conference
• Year: 2000
• Where: ESA
• Authors: Maurizio Pizzonia, Roberto Tamassia
• Keywords: Algorithms, ESA 2000, Minimum Depth Embedding, Planar Embeddings, Planar Graphs