
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Tiziana Calamoneri, Stephan Olariu, Rossella Petreschi, "A Simple Parallel Algorithm to Draw Cubic Graphs," IEEE Transactions on Parallel and Distributed Systems, vol. 11, no. 10, pp. 10091018, October, 2000.  
BibTex  x  
@article{ 10.1109/71.888641, author = {Tiziana Calamoneri and Stephan Olariu and Rossella Petreschi}, title = {A Simple Parallel Algorithm to Draw Cubic Graphs}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {11}, number = {10}, issn = {10459219}, year = {2000}, pages = {10091018}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.888641}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  A Simple Parallel Algorithm to Draw Cubic Graphs IS  10 SN  10459219 SP1009 EP1018 EPD  10091018 A1  Tiziana Calamoneri, A1  Stephan Olariu, A1  Rossella Petreschi, PY  2000 KW  Cubic graphs KW  orthogonal drawing KW  computer graphics. visualization KW  layout KW  parallel algorithms. VL  11 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—The main contribution of this work is to offer a simple and costefficient parallel algorithm that, given an arbitrary
[1] K. Abrahamson, N. Dadoun, D.G. Kirkpatrick, and T. Przytycka, "A Simple Parallel Tree Contraction Algorithm," J. Algorithms, vol. 10, no. 2, pp. 287302, 1989.
[2] A. Aho, J.K. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms. Reading, Mass.: Addison Wesley, 1973.
[3] R.J. Anderson and G.L. Miller, “Deterministic Parallel List Ranking,” Algorithmica, vol. 6, pp. 859–868 1991.
[4] T. Biedl and G. Kant, “A Better Heuristic for Orthogonal Graph Drawings,” Computational Geometry: Theory and Applications, vol. 9, pp. 159–180, 1998.
[5] T. Calamoneri, “Does Cubicity Help to Solve Problems?” PhD thesis, IX297, Univ. of Rome (La Sapienza), 1997.
[6] T. Calamoneri, S. Jannelli, and R. Petreschi, “Experimental Comparison of Graph Drawing Algorithms for Cubic Graphs,” J. Graph Algorithms and Applications, vol. 3, no. 2, pp. 1–23, 1999.
[7] T. Calamoneri and R. Petreschi, “An Efficient Orthogonal Grid Drawing Algorithm for Cubic Graphs” Proc. COCOON '95, pp. 31–40, 1995.
[8] T. Calamoneri and R. Petreschi, “A Parallel Algorithm for Orthogonal Grid Drawings of Cubic Graphs,” J. Parallel and Distributed Computing, vol. 55, pp. 94108, 1998.
[9] R. Cole, "Parallel Merge Sort," SIAM J. Computing, vol. 17, pp. 770785, 1988.
[10] R. Cole and U. Vishkin, "Approximate Parallel Scheduling. Part 1: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time," SIAM J. Computing, vol. 18, pp. 128142, 1988.
[11] G. DiBattista, P. Eades, R. Tamassia, and I.G. Tollis, "Algorithms for Drawing Graphs: An Annotated Bibliography," Computational Geometry: Theory and Applications, vol. 4, no 5, pp. 235282, 1994. Also available via anonymous ftp from,, andin.
[12] G. Di Battista, G. Liotta, and F. Vargiu, “Spirality and Optimal Orthogonal Drawings,” SIAM J. Computers, vol. 27, no. 6, pp. 1,7641,811, 1998.
[13] A. Gibbons and W. Rytter, Efficient Parallel Algorithms. Cambridge Univ. Press, 1988.
[14] R. Greenlaw and R. Petreschi, “Cubic Graphs,” ACM Computing Surveys, vol. 27, no. 4, pp. 471–495, 1995.
[15] J. J'aJ'a, An Introduction to Parallel Algorithms.New York: AddisonWesley, 1992.
[16] J. Jàjà and J. Simon, “Parallel Algorithms in Graph Theory: Planarity Testing,” SIAM J. Computing, vol. 11, pp. 314–328, 1982.
[17] G. Kant, “Drawing Planar Graphs Using the Canonical Ordering,” Proc. 33th Ann. IEEE Symp. Foundations of Computer Science (FOCS '92), pp. 101–110, 1992.
[18] Y. Liu, P. Marchioro, and R. Petreschi, “At Most Single Bend Embedding of Cubic Graphs,” Applied Mathematics, vol. 9, no. 2, pp. 127–142, 1994.
[19] G.L. Miller and J.H. Reif, “Parallel Tree Contraction and Its Applications,” Proc. 26th Ann. IEEE Symp. Foundations of Computer Science (FOCS '85), pp. 478–489, 1985.
[20] A. Papakostas and I. G. Tollis, "Improved Algorithms and Bounds for Orthogonal Drawings," Proc. 1994 Symp. Graph Drawing (GD '94), pp. 4051, 1994.
[21] F.P. Preparata and M.I. Shamos, Computational Geometry. SpringerVerlag, 1985.
[22] B.T. Preas and M.J. Lorenzetti, eds., Physical Design Automation of VLSI Systems. Menlo Park, Calif.: Benjamin/Cummings, 1988.
[23] M.J. Quinn, Parallel Computing: Theory and Practice.New York: McGrawHill, 1994.
[24] M.S. Rahman, S. Nakano, and T. Nishizeki, “A LinearTime Algorithm for Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs,” Proc. Graph Drawing `97, pp. 99–110, 1997.
[25] R. Tamassia, I.G. Tollis, and J.S. Vitter, “Lower Bounds and Parallel Algorithms for Planar Orthogonal Grid Drawings,” Proc. IEEE Symp. Parallel and Distributed Processing, pp. 1–8, 1991.
[26] R. Tamassia, J.S. Vitter, “Parallel Transitive Closure and Point Location in Planar Structures,” SIAM J. Computing, vol. 20, no. 4, pp. 708–725, 1991.
[27] J.C. Wyllie, “The Complexity of Parallel Computations,” PhD thesis, Dept. of Computer Science, Cornell Univ., 1979.