Concepedia

Em-connectivity Algorithms

EM-Connectivity Algorithms is a class of external memory algorithms designed to efficiently determine connected components in large-scale graphs by minimizing I/O operations between main memory and secondary storage during graph traversal and connectivity queries.

2

Publications

32

Citations

5

Authors

4

Institutions

Publications per year

2017–2026

0

Variants

External Memory Connectivity Algorithms

Parents

Publications

2

1–2 of 2

Authors

5

  1. CC
    Chandra Chekuri

    University of Illinois Urbana-Champaign, United States

    1 publications · 20 citations

    1

    h-index

  2. SG
    Stefan Gumhold

    Technische Universität Dresden, Germany

    1 publications · 12 citations

    1

    h-index

  3. NK
    Nitish Korula

    Google (United States), United States

    1 publications · 20 citations

    1

    h-index

  4. CG
    Craig Gotsman

    Technion – Israel Institute of Technology, Israel

    1 publications · 12 citations

    1

    h-index

  5. MI
    Martin Isenburg

    University of North Carolina at Chapel Hill, United States

    1 publications · 12 citations

    1

    h-index

1–5 of 5

Institutions

4

  1. University of Illinois Urbana-Champaign

    Urbana, United States

    1 h-index

    2 publications

    40 citations

  2. University of Tübingen

    Tübingen, Germany

    1 h-index

    1 publications

    12 citations

  3. University of North Carolina at Chapel Hill

    Chapel Hill, United States

    1 h-index

    1 publications

    12 citations

  4. Technion – Israel Institute of Technology

    Haifa, Israel

    1 h-index

    1 publications

    12 citations

1–4 of 4

Venues

  1. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 1 publications · 20 citations

    1

    h-index

1–1