Zhiyuan Lin

Learn More
—Graph computation approaches such as GraphChi and TurboGraph recently demonstrated that a single PC can perform efficient computation on billion-node graphs. To achieve high speed and scalability, they often need sophisticated data structures and memory management strategies. We propose a minimalist approach that forgoes such requirements, by leverag-ing(More)
The field of graph visualization has produced a wealth of visualization techniques for accomplishing a variety of analysis tasks. Therefore analysts often rely on a suite of different techniques, and visual graph analysis application builders strive to provide this breadth of techniques. To provide a holistic model for specifying network visualization(More)
—Mobile devices have become increasingly central to our everyday activities, due to their portability, multi-touch capabilities, and ever-improving computational power. Such attractive features have spurred research interest in leveraging mobile devices for computation. We explore a novel approach that aims to use a single mobile device to perform scalable(More)
—We present a scalable, interactive graph visu-alization system to support multi-resolution exploration of million-node graphs in real time. By adapting a state-of-the-art graph algorithm, called Slash & Burn, our prototype system generates a multi-resolution view of graphs with up to 69 million edges under a few seconds. We are experimenting with(More)
—Large graphs with billions of nodes and edges are increasingly common, calling for new kinds of scalable computation frameworks. Although popular, distributed approaches can be expensive to build, or require many resources to manage or tune. State-of-the-art approaches such as GraphChi and TurboGraph recently have demonstrated that a single machine can(More)
There is a wealth of visualization techniques available for graph and network visualization. However, each of these techniques was designed for a specific task. Many graph visualization techniques and the transitions between them can be specified using a set of operations on the visualization elements such as positioning or resizing nodes, showing or hiding(More)
Like traditional media, social media in China is subject to censorship. However, in limited cases, activists have employed homophones of censored keywords to avoid detection by keyword matching algorithms. In this paper, we show that it is possible to scale this idea up in ways that make it difficult to defend against. Specifically, we present a(More)
Figure 1: (a) Overview of the top 10 movies and top 10 components of the Rotten Tomatoes related movies graph. Node are movies; an edge connects two movies if they are similar. (b) Previewing a bubble shows a few movies and components within in; the user can expand the bubble further to show more nodes. (c) A broken down bubble showing all edges within a(More)