Sciweavers

77
Voted
ESA
2000
Springer
122views Algorithms» more  ESA 2000»
15 years 1 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 importan...
Maurizio Pizzonia, Roberto Tamassia