Library of Compact Data Structures to test different implementations of Compact Temporal Graphs using several levels of compactness
-
Updated
Oct 22, 2021 - C++
Library of Compact Data Structures to test different implementations of Compact Temporal Graphs using several levels of compactness
The code accompanies the paper "On Atomic Cliques in Temporal Graphs".
ARROW: Approximating Reachability using Random walks Over Web scale graphs
Code of the paper "Efficient Algorithms to Mine Maximal Span-Trusses From Temporal Graphs".
Segundo trabalho prático da disciplina de Algoritmos I
Add a description, image, and links to the temporal-graphs topic page so that developers can more easily learn about it.
To associate your repository with the temporal-graphs topic, visit your repo's landing page and select "manage topics."