How Do Graph Relabeling Algorithms Improve Memory Locality
2021
Relabeling algorithms aim to improve the poor memory locality of graph processing by changing the order of vertices. This paper analyses the functionality of three state-of-the-art relabeling algorithms: SlashBurn, GOrder, and Rabbit-Order for real-world graphs.
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
16
References
2
Citations
NaN
KQI