More graph drawing in the cloud: data-oblivious st-numbering, visibility representations, and orthogonal drawing of biconnected planar graphs

Authors:
Michael T. Goodrich;Joseph A. Simons
Affiliations:
Department of Computer Science, University of California, Irvine;Department of Computer Science, University of California, Irvine
Venue:
GD'12 Proceedings of the 20th international conference on Graph Drawing
Year:
2012

Citing 4
Cited 0

Optimal parallel algorithms for transitive closure and point location in planar structures

SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Perfectly secure oblivious RAM without random oracles

TCC'11 Proceedings of the 8th conference on Theory of cryptography
Optimal EREW parallel algorithms for connectivity, ear decomposition and st-numbering of planar graphs

IPPS '91 Proceedings of the Fifth International Parallel Processing Symposium
Graph drawing in the cloud: privately visualizing relational data using small working storage

GD'12 Proceedings of the 20th international conference on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

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.