The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—The main contribution of this work is to offer a simple and cost-efficient parallel algorithm that, given an arbitrary <tmath>$n$</tmath>-vertex cubic graph <tmath>$G$</tmath> as input, produces an orthogonal grid drawing of <tmath>$G$</tmath> in <tmath>${\rm O}(\log n)$</tmath> time, using <tmath>$n$</tmath> 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.</p>
Cubic graphs, orthogonal drawing, computer graphics. visualization, layout, parallel algorithms.

T. Calamoneri, S. Olariu and R. Petreschi, "A Simple Parallel Algorithm to Draw Cubic Graphs," in IEEE Transactions on Parallel & Distributed Systems, vol. 11, no. , pp. 1009-1018, 2000.
93 ms
(Ver 3.3 (11022016))