The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.10 - October (2000 vol.11)
pp: 1009-1018
ABSTRACT
<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>
INDEX TERMS
Cubic graphs, orthogonal drawing, computer graphics. visualization, layout, parallel algorithms.
CITATION
Tiziana Calamoneri, Stephan Olariu, Rossella Petreschi, "A Simple Parallel Algorithm to Draw Cubic Graphs", IEEE Transactions on Parallel & Distributed Systems, vol.11, no. 10, pp. 1009-1018, October 2000, doi:10.1109/71.888641
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool