Abstract
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.
Keywords
References
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)
Gazit, H.: Optimal EREW parallel algorithms for connectivity, ear decomposition and st-numbering of planar graphs. In: IPPS, pp. 84–91 (1991)
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)
Tamassia, R., Vitter, J.S.: Optimal parallel algorithms for transitive closure and point location in planar structures. In: SPAA, pp. 399–408 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goodrich, M.T., Simons, J.A. (2013). More Graph Drawing in the Cloud: Data-Oblivious st-Numbering, Visibility Representations, and Orthogonal Drawing of Biconnected Planar Graphs. In: Didimo, W., Patrignani, M. (eds) Graph Drawing. GD 2012. Lecture Notes in Computer Science, vol 7704. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36763-2_56
Download citation
DOI: https://doi.org/10.1007/978-3-642-36763-2_56
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36762-5
Online ISBN: 978-3-642-36763-2
eBook Packages: Computer ScienceComputer Science (R0)