aepasto / triest
TRIEST: TRIÈST: Counting Local and Global Triangles in Fully-Dynamic Streams with Fixed Memory Size
☆8Updated 8 years ago
Alternatives and similar repositories for triest:
Users that are interested in triest are comparing it to the libraries listed below
- Parallel Weighted Random Sampling☆19Updated 4 years ago
- Experimental Setup for Performance Analysis of Streaming Algorithms☆31Updated 3 years ago
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆24Updated last year
- ☆11Updated 10 months ago
- FORA: Simple and Effective Approximate Single-Source Personalized Pagerank☆31Updated 4 years ago
- Code for the paper titled "Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins". VLDB'19☆32Updated 4 years ago
- ☆17Updated 4 months ago
- Source code of "RapidFlow: An Efficient Approach to Continuous Subgraph Matching" published in VLDB'2022 - By Shixuan Sun, Xibo Sun, Bing…☆30Updated 2 years ago
- The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"☆25Updated 7 years ago
- ☆16Updated 3 weeks ago
- ☆27Updated 2 years ago
- ☆11Updated 5 months ago
- ☆16Updated last month
- This is the Lernaean Hydra Archive (LHA) for Similarity Search.☆22Updated last year
- Dynamic data structure for sparse graphs.☆30Updated last year
- Edge-centric Graph Processing System using Streaming Partitions☆82Updated 7 years ago
- ☆28Updated 6 months ago
- Code and data for the Clustering Uncertain Graphs paper☆9Updated 2 years ago
- A Multicore, NUMA Optimised Data Stream Processing System☆38Updated 2 years ago
- A Framework for Graph Sampling and Random Walk on GPUs.☆39Updated 2 months ago
- Source code of "ThunderRW: An In-Memory Graph Random Walk Engine" published in VLDB'2021 - By Shixuan Sun, Yuhang Chen, Shengliang Lu, Bi…☆26Updated 3 years ago
- ☆17Updated 3 years ago
- Differentiated Computation and Partitioning on Skewed (Natural or Bipartite) Graphs☆66Updated 3 years ago
- Algorithms to list k-cliques in real-world graphs☆26Updated 4 years ago
- A graph application benchmark suite☆21Updated 9 years ago
- Crystal is a novel method for distributed subgraph matching on very large graphs. Crystal outperforms existing methods by several orders …☆11Updated 6 years ago
- Generic driver for LDBC Graphalytics implementation☆83Updated 4 months ago
- Fast Multiple Independent Random Number Sequences Generation on FPGAs☆14Updated 3 years ago
- A simple implementation of the packed memory array☆19Updated 11 years ago
- Linked Stream Benchmark☆13Updated 2 years ago