Skip to content

Commit 6315575

Browse files
authored
Update README.md
1 parent 9e70910 commit 6315575

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -7,7 +7,7 @@
77
In this framework, we offer a novel (semi-)dynamic compression vector that functions as a drop-in replacement to standard arrays, like std::vector in C++, used to store block assignments in streaming graph partitioners.
88

99
This repository contains the code to accompany our paper: *Adil Chhabra, Florian Kurpicz, Christian Schulz, Dominik Schweisgut, Daniel Seemaier. Partitioning Trillion Edge Graphs on Edge Devices. In SIAM Conference on Applied and Computational Discrete Algorithms (ACDA), to appear, 2025.*
10-
You can find a freely accessible online version [in the arXiv]([https://arxiv.org/abs/1710.07565](https://arxiv.org/abs/2410.07732)).
10+
You can find a freely accessible online technical report on arXiv: https://arxiv.org/abs/2410.07732.
1111

1212
## Can we use the (semi-)dynamic compression vector to reduce memory consumption in our streaming algorithm?
1313
Yes, if your streaming algorithm stores arrays with repeating values, you can greatly benefit from our compression vector which supports both append and access operations, and is very easy to integrate. The code and more details on how to use the compression vector

0 commit comments

Comments
 (0)