Computational geometry: an introduction
Computational geometry: an introduction
Efficient parallel algorithms
SIAM Journal on Computing
A simple parallel tree contraction algorithm
Journal of Algorithms
Parallel transitive closure and point location in planar structures
SIAM Journal on Computing
An introduction to parallel algorithms
An introduction to parallel algorithms
Parallel computing (2nd ed.): theory and practice
Parallel computing (2nd ed.): theory and practice
Algorithms for drawing graphs: an annotated bibliography
Computational Geometry: Theory and Applications
ACM Computing Surveys (CSUR)
A better heuristic for orthogonal graph drawings
Computational Geometry: Theory and Applications
Spirality and Optimal Orthogonal Drawings
SIAM Journal on Computing
Orthogonally drawing cubic graphs in parallel
Journal of Parallel and Distributed Computing
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
An Efficient Orthogonal Grid Drawing Algorithm For Cubic Graphs
COCOON '95 Proceedings of the First Annual International Conference on Computing and Combinatorics
A Linear Algorithm for Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Improved Algorithms and Bounds for Orthogonal Drawings
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
The complexity of parallel computations
The complexity of parallel computations
| Hi-index | 0.00 |
The main contribution of this work is to offer a simple and cost-efficient parallel algorithm that, given an arbitrary $n$-vertex cubic graph $G$ as input, produces an orthogonal grid drawing of $G$ in ${\rm O}(\log n)$ time, using $n$ processors on an EREW PRAM. Our algorithm matches the time and cost performance of the best previously-known algorithm while at the same time improving the constant factors involved in two important metrics: layout area and number of bends. More importantly, however, our algorithm stands out by its conceptual simplicity and ease of implementation.