Atlas: Local Graph Exploration in a Global Context
Atlas is an interactive graph exploration system that wields a fast and scalable edge decomposition algorithm, based on iterative vertex-edge peeling, that decomposes million-edge graphs in seconds, scaling to graphs with up to hundreds of millions of edges. Atlas introduces a new approach for exploring large graphs 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.
For the Atlas edge decomposition algorithm, go to github.com/fredhohman/atlas-algorithm.
Download or clone this repository:
git clone https://github.com/fredhohman/atlas.git
Within the cloned repo, install the required packages with npm:
npm install
To run Atlas:
npm run start
To load your own graph data into Atlas, see the instructions here.
Atlas requires npm to run.
Atlas uses a fast, scalable edge decomposition to split graphs into graph layers for visualizaion. For the edge decomposition algorithm, go to github.com/fredhohman/atlas-algorithm.
MIT License. See LICENSE.md
.
For questions or support open an issue or contact Fred Hohman.