Computer aided layout of entity relationship diagrams
Journal of Systems and Software - Special double issue on the entity-relationship approach to databases and related software
A Layout algorithm for data flow diagrams
IEEE Transactions on Software Engineering
On embedding a graph in the grid with the minimum number of bends
SIAM Journal on Computing
On the complexity of covering vertices by faces in a planar graph
SIAM Journal on Computing
Automatic graph drawing and readability of diagrams
IEEE Transactions on Systems, Man and Cybernetics
An experimental comparison of four graph drawing algorithms
Computational Geometry: Theory and Applications
Spirality and Optimal Orthogonal Drawings
SIAM Journal on Computing
Journal of the ACM (JACM)
On the Computational Complexity of Upward and Rectilinear Planarity Testing
SIAM Journal on Computing
Optimizing over All Combinatorial Embeddings of a Planar Graph
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Optimal Compaction of Orthogonal Grid Drawings
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Computing Orthogonal Drawings with the Minimum Number of Bends
WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
Dynamic Grid Embedding with Few Bends and Changes
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Computing Orthogonal Drawings in a Variable Embedding Setting
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Drawing High Degree Graphs with Low Bend Numbers
GD '95 Proceedings of the Symposium on Graph Drawing
A Bayesian Paradigm for Dynamic Graph Layout
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Pitfalls of Using PQ-Trees in Automatic Graph Drawing
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
On the Compuational Complexity of Upward and Rectilinear Planarity Testing
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Minimum depth graph embeddings and quality of the drawings: an experimental analysis
GD'05 Proceedings of the 13th international conference on Graph Drawing
Computing a minimum-depth planar graph embedding in O(n4) time
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |
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.