More Graph Drawing in the Cloud: Data-Oblivious st-Numbering, Visibility Representations, and Orthogonal Drawing of Biconnected Planar Graphs

  • Michael T. Goodrich
  • Joseph A. Simons
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7704)


We give a new efficient data-oblivious PRAM simulation and several new data-oblivious graph-drawing algorithms with application to privacy-preserving graph-drawing in a cloud computing context.


Data-Oblivious Cloud Computing st-Numbering Visibility Representation Orthogonal Drawing 


  1. 1.
    Damgård, I., Meldgaard, S., Nielsen, J.B.: Perfectly Secure Oblivious RAM without Random Oracles. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 144–163. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  2. 2.
    Gazit, H.: Optimal EREW parallel algorithms for connectivity, ear decomposition and st-numbering of planar graphs. In: IPPS, pp. 84–91 (1991)Google Scholar
  3. 3.
    Goodrich, M.T., Ohrimenko, O., Tamassia, R.: Graph Drawing in the Cloud: Privately Visualizing Relational Data Using Small Working Storage. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 43–54. Springer, Heidelberg (2013)Google Scholar
  4. 4.
    Tamassia, R., Vitter, J.S.: Optimal parallel algorithms for transitive closure and point location in planar structures. In: SPAA, pp. 399–408 (1989)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Michael T. Goodrich
    • 1
  • Joseph A. Simons
    • 1
  1. 1.Department of Computer ScienceUniversity of CaliforniaIrvineUSA

Personalised recommendations