Sciweavers

ESA
2000
Springer
122views Algorithms» more  ESA 2000»
14 years 3 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
COCOON
1999
Springer
14 years 3 months ago
Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs
Abstract. Hierarchical graphs are an important class of graphs for modelling many real applications in software and information visualization. In this paper, we shall investigate t...
Xuemin Lin, Peter Eades