https://github.com/fredhohman/atlas-algorithm
Atlas Edge Decomposition Algorithm
https://github.com/fredhohman/atlas-algorithm
edge-decomposition graph-decomposition graph-visualization
Last synced: 18 days ago
JSON representation
Atlas Edge Decomposition Algorithm
- Host: GitHub
- URL: https://github.com/fredhohman/atlas-algorithm
- Owner: fredhohman
- License: mit
- Created: 2018-01-24T23:41:44.000Z (about 8 years ago)
- Default Branch: master
- Last Pushed: 2019-03-03T20:54:20.000Z (about 7 years ago)
- Last Synced: 2025-04-19T03:06:58.018Z (12 months ago)
- Topics: edge-decomposition, graph-decomposition, graph-visualization
- Language: C++
- Homepage:
- Size: 25.4 KB
- Stars: 7
- Watchers: 2
- Forks: 5
- Open Issues: 1
-
Metadata Files:
- Readme: README.md
- License: LICENSE.md
Awesome Lists containing this project
README
# Atlas Edge Decomposition Algorithm
This is the fast, scalable implementation of [edge decomposition based on fixed points of degree peeling][edge-decomp] used in [Atlas][atlas].
For the main Atlas visualization repository, see [github.com/fredhohman/atlas][atlas].
## Installation
Download or clone this repository.
```bash
git clone https://github.com/fredhohman/atlas-algorithm.git
```
From the directory, compile the code by
```
g++ -o atlas-decomposition -g -fopenmp -O3 parallelkcore.cpp
```
## Usage
We first convert a plain text edge list file to a `.bin` to use for algorithm. Input text files should be comma (or tab) separated where each row contains a `source` and `target` (these must be numbers).
**Note:** graphs should not have:
* self-loops / self-edges
* duplicate edges (multi-graph)
For example, a graph with three edges would look like:
```
1, 2
1, 3
2, 4
```
Convert the text edge list to a `.bin` using the mmap.jar file available here: http://poloclub.gatech.edu/mmap/MMap.zip
```bash
java -jar mmap.jar Convert
```
The algorithm takes in this `.bin` file to perform the decomposition. It outputs a `myGraph-decomposition.csv` file where each row contains three values: the `source`, `target`, and `peel`. The `source` and `target` columns together form the original edge list, and the new column `peel` contains the peel assignment, i.e., what layer an edge belongs to. To run the algorithm, use:
```bash
./atlas-decomposition .bin <# of edges> <# of vertices>
```
It also outputs a `myGraph-decomposition-info.json` file that contains metadata such as the number of vertices in the graph, number of edges in the graph, time taken to preprocess the data, and time taken to run the algorithm.
## Example
For an example of what the output looks like, see [github.com/fredhohman/atlas/data][example]
## Citation
**[Atlas: Local Graph Exploration in a Global Context](https://fredhohman.com/papers/atlas)**
James Abello\*, Fred Hohman\*, Varun Bezzam, Duen Horng (Polo) Chau
*ACM Conference on Intelligent User Interfaces (IUI). Los Angeles, CA, USA, 2019.*
\* Authors contributed equally.
```
@inproceedings{hohman2019atlas,
title={Atlas: Local Graph Exploration in a Global Context},
author={Abello, James and Hohman, Fred and Bezzam, Varun and Chau, Duen Horng},
booktitle={Proceedings of the International Conference on Intelligent User Interfaces},
year={2019},
organization={ACM}
}
```
## License
MIT License. See [`LICENSE.md`](LICENSE.md).
## Contact
For questions or support [open an issue][issues] or contact [Fred Hohman][fred].
[edge-decomp]: https://link.springer.com/article/10.1007/s13278-014-0191-7
[atlas]: https://github.com/fredhohman/atlas
[fred]: http://fredhohman.com
[example]: https://github.com/fredhohman/atlas/tree/master/data
[issues]: https://github.com/fredhohman/atlas-algorithm/issues