@inproceedings{740076e5fa4c41dbba004f7297c9aa54,
title = "GMine: A System for Scalable, Interactive Graph Visualization and Mining",
abstract = "Several graph visualization tools exist. However, they are not able to handle large graphs, and/or they do not allow interaction. We are interested on large graphs, with hundreds of thousands of nodes. Such graphs bring two challenges: the first one is that any straightforward interactive manipulation will be prohibitively slow. The second one is sensory overload: even if we could plot and replot the graph quickly, the user would be overwhelmed with the vast volume of information because the screen would be too cluttered as nodes and edges overlap each other. Our GMine system addresses both these issues, by using summarization and multi-resolution. GMine offers multi-resolution graph exploration by partitioning a given graph into a hierarchy of communities-within-communities and storing it into a novel R-tree-like structure which we name G-Tree. GMine offers summarization by implementing an innovative subgraph extraction algorithm and then visualizing its output.",
author = "Rodrigues, {Jos{\'e} F.} and Hanghang Tong and Traina, {Agma J.M.} and Christos Faloutsos and Jure Leskovec",
note = "Publisher Copyright: {\textcopyright} 2006 Association for Computing Machinery. All rights reserved.; 32nd International Conference on Very Large Data Bases, VLDB 2006 ; Conference date: 12-09-2006 Through 15-09-2006",
year = "2006",
language = "English (US)",
isbn = "1595933859",
series = "VLDB 2006 - Proceedings of the 32nd International Conference on Very Large Data Bases",
publisher = "Association for Computing Machinery",
pages = "1195--1198",
booktitle = "VLDB 2006 - Proceedings of the 32nd International Conference on Very Large Data Bases",
address = "United States",
}