https://github.com/fralotito/span_trusses
Code of the paper "Efficient Algorithms to Mine Maximal Span-Trusses From Temporal Graphs".
https://github.com/fralotito/span_trusses
community-detection k-truss temporal-graphs
Last synced: 8 months ago
JSON representation
Code of the paper "Efficient Algorithms to Mine Maximal Span-Trusses From Temporal Graphs".
- Host: GitHub
- URL: https://github.com/fralotito/span_trusses
- Owner: FraLotito
- Created: 2019-09-11T20:30:50.000Z (over 6 years ago)
- Default Branch: master
- Last Pushed: 2021-11-15T20:45:45.000Z (over 4 years ago)
- Last Synced: 2025-08-29T11:39:32.382Z (10 months ago)
- Topics: community-detection, k-truss, temporal-graphs
- Language: C++
- Homepage:
- Size: 293 KB
- Stars: 2
- Watchers: 1
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Efficient Algorithms to Mine Maximal Span-Trusses From Temporal Graphs
Code of the paper ["Efficient Algorithms to Mine Maximal Span-Trusses From Temporal Graphs"](https://arxiv.org/pdf/2009.01928.pdf).
## Compiling
`g++ file.cpp -std=c++11 -O3 -o file`
## Datasets
More datasets available upon request.
## References
* [Truss Decomposition in Massive Networks](https://github.com/cntswj/truss-decomposition)
* [Mining (maximal) Span-cores from Temporal Networks ](https://github.com/egalimberti/span_cores)