Work

Data-Oblivious Graph Drawing Model and Algorithms

Year: 2012

Type: preprint

Abstract: We study graph drawing in a cloud-computing context where data is stored externally and processed using a small local working storage. We show that a number of classic graph drawing algorithms can be efficiently implemented in such a framework where the client can maintain privacy while constructing a drawing of her graph.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1209.0756

Authors: Goodrich, Michael T., Ohrimenko, Olga, Tamassia, Roberto

Institutions: Association for Computing Machinery, University of California, Irvine, Brown University

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: National Science Foundation, NetApp

Awards: Collaborative Research: Algorithms for Graphs on Surfaces, TWC: Medium: Collaborative: Privacy-Preserving Distributed Storage and Computation, TWC: Medium: Collaborative: Privacy-Preserving Distributed Storage and Computation, Collaborative Research: Algorithms for Graphs on Surfaces

OpenAlex ID: W1581575728

Cites: 30

Cited by: 18

Related to: 20