Cache-oblivious Graph Algorithms
Cache-Oblivious Graph Algorithms is a class of graph algorithms designed to exploit the memory hierarchy efficiently without explicit knowledge of cache parameters, achieving optimal or near-optimal cache performance across all levels of a multi-level memory system through recursive divide-and-conquer strategies that ensure good locality of reference.
16
Publications
897
Citations
35
Authors
25
Institutions
Publications per year
2017–2026
4
16
Multicore triangle computations without tuning
Julian Shun, Kanat Tangwongsan · 2015 · 166 citations
Speedup Graph Processing by Graph Ordering
Hao Wei, Jeffrey Xu Yu, Can Lu et al. · 2016 · 154 citations
Cache-oblivious priority queue and graph algorithm applications
Lars Arge, Michael A. Bender, Erik D. Demaine et al. · 2002 · 101 citations
The input/output complexity of triangle enumeration
2014 · 59 citations · Full text
1–5 of 16
35
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 35
25
University of Southern California
Los Angeles, United States
4 h-index
11 publications
431 citations

UNSW Sydney
Sydney, Australia
2 h-index
3 publications
246 citations
The University of Texas at Austin
Austin, United States
2 h-index
4 publications
64 citations
Carnegie Mellon University
Pittsburgh, United States
1 h-index
1 publications
166 citations
Istituto di Scienza e Tecnologie dell'Informazione "Alessandro Faedo"
Pisa, Italy
1 h-index
1 publications
19 citations
Adobe Systems (United States)
San Jose, United States
1 h-index
2 publications
48 citations

DEVCOM Army Research Laboratory
Adelphi, United States
1 h-index
1 publications
11 citations

University of Helsinki
Helsinki, Finland
1 h-index
1 publications
19 citations
1–8 of 25
TOPC · 1 publications · 35 citations
1
h-index
TPDS · 1 publications · 103 citations
1
h-index
Repository · 1 publications · 51 citations
1
h-index
1 publications · 26 citations
1
h-index
TKDE · 1 publications · 41 citations
1
h-index
1–5