Large Graph Exploration via Subgraph Discovery and Decomposition
This addresses the challenge of making sense of large graphs for researchers or analysts, though it appears incremental as it builds on existing decomposition methods with a new interactive framework.
The paper tackles the problem of exploring large graphs by developing Graph Playground, an interactive system that uses a fast edge decomposition algorithm to decompose million-edge graphs in seconds and reveals subgraph structures and vertex roles through a 3D representation.
We are developing an interactive graph exploration system called Graph Playground for making sense of large graphs. Graph Playground offers a fast and scalable edge decomposition algorithm, based on iterative vertex-edge peeling, to decompose million-edge graphs in seconds. Graph Playground introduces a novel graph exploration approach and a 3D representation framework that simultaneously reveals (1) peculiar subgraph structure discovered through the decomposition's layers, (e.g., quasi-cliques), and (2) possible vertex roles in linking such subgraph patterns across layers.