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

Authors

35

  1. VK
    Viktor K. Prasanna

    University of Southern California, United States

    3 publications · 167 citations

    3

    h-index

  2. MA
    Michael A. Bender

    Stony Brook University, United States

    2 publications · 127 citations

    2

    h-index

  3. JP
    Joon‐Sang Park

    Hongik University, South Korea

    2 publications · 132 citations

    2

    h-index

  4. RC
    Rezaul Chowdhury

    The University of Texas at Austin, United States

    2 publications · 32 citations

    2

    h-index

  5. ED
    Erik D. Demaine

    Massachusetts Institute of Technology, United States

    2 publications · 127 citations

    2

    h-index

1–5 of 35

Venues

  1. ACM Transactions on Parallel Computing

    TOPC · 1 publications · 35 citations

    1

    h-index

  2. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 1 publications · 103 citations

    1

    h-index

  3. IT University Of Copenhagen (IT University of Copenhagen)

    Repository · 1 publications · 51 citations

    1

    h-index

  4. SIAM Journal on Computing

    1 publications · 26 citations

    1

    h-index

  5. IEEE Transactions on Knowledge and Data Engineering

    TKDE · 1 publications · 41 citations

    1

    h-index

1–5