Dynamic Reachability

Dynamic Reachability is a computational framework in dynamic data structures that enables the maintenance and querying of reachability information in a directed graph undergoing incremental updates such as edge insertions or deletions.

89

Publications

4.3K

Citations

231

Authors

124

Institutions

Publications per year

2017–2026

31

Authors

231

  1. UZ
    Uri Zwick

    Tel Aviv University, Israel

    4 publications · 249 citations

    4

    h-index

  2. LR
    Liam Roditty

    Bar-Ilan University, Israel

    4 publications · 249 citations

    4

    h-index

  3. YY
    Yiming Yang

    University of Edinburgh, United Kingdom

    3 publications · 76 citations

    3

    h-index

  4. JL
    John Lygeros

    ETH Zurich, Switzerland

    3 publications · 99 citations

    3

    h-index

  5. SV
    Sethu Vijayakumar

    University of Edinburgh, United Kingdom

    3 publications · 76 citations

    3

    h-index

1–5 of 231

Venues

  1. Automatica

    7 publications · 656 citations

    7

    h-index

  2. Theoretical Computer Science

    4 publications · 284 citations

    4

    h-index

  3. IEEE Transactions on Automatic Control

    2 publications · 150 citations

    3

    h-index

  4. 2

    h-index

  5. IEEE Transactions on Robotics

    2 publications · 482 citations

    2

    h-index

1–5