Demonstrating interactive multi-resolution large graph exploration

Zhiyuan Lin, Nan Cao, Hanghang Tong, Fei Wang, U. Kang, Duen Horng Polo Chau

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Scopus citations


We present a scalable, interactive graph visualization 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 interaction techniques that help users interactively explore this overview and drill down into details. While many visualization systems for million-node graphs require dedicated servers to process the graphs, our prototype runs on a commodity laptop computer. We aim to handle graphs that are at least an order of magnitude (100M edges) larger than what current systems can support. We demonstrate our system's usage, benefits, and scalability using two large graphs: a Live Journal friendship network with 69 million edges, and a related-movies network from Rotten Tomatoes with 200K edges.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE 13th International Conference on Data Mining Workshops, ICDMW 2013
PublisherIEEE Computer Society
Number of pages4
StatePublished - 2013
Externally publishedYes
Event2013 13th IEEE International Conference on Data Mining Workshops, ICDMW 2013 - Dallas, TX, United States
Duration: Dec 7 2013Dec 10 2013


Other2013 13th IEEE International Conference on Data Mining Workshops, ICDMW 2013
Country/TerritoryUnited States
CityDallas, TX


  • Graph decomposition
  • Hubs and spokes
  • Interactive graph visualization
  • Multi-resolution

ASJC Scopus subject areas

  • Software


Dive into the research topics of 'Demonstrating interactive multi-resolution large graph exploration'. Together they form a unique fingerprint.

Cite this