How Do Graph Relabeling Algorithms Improve Memory Locality?
Mohsen Koohi EsfahaniPeter KilpatrickHans VandierendonckPublished in: ISPASS (2021)
Keyphrases
- memory usage
- graph theory
- data structure
- theoretical analysis
- maximum flow
- computational cost
- graph search
- memory efficient
- neural network
- directed graph
- combinatorial optimization
- partitioning algorithm
- limited memory
- graph theoretic
- graph matching
- structured data
- orders of magnitude
- benchmark datasets
- computationally efficient
- search algorithm
- learning algorithm