Sciweavers

Share
ESA
2000
Springer

Minimum Depth Graph Embedding

10 years 5 months ago
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.
Maurizio Pizzonia, Roberto Tamassia
Added 24 Aug 2010
Updated 24 Aug 2010
Type Conference
Year 2000
Where ESA
Authors Maurizio Pizzonia, Roberto Tamassia
Comments (0)
books