Persistent Graph Data Structures

Persistent Graph Data Structures is a class of immutable graph representations that preserve previous versions of the structure upon modification, enabling efficient access and updates across multiple versions while maintaining consistency and version history.

16

Publications

541

Citations

39

Authors

24

Institutions

Publications per year

2017–2026

5

Authors

39

  1. GS
    Gerth Stølting Brodal

    Aarhus University, Denmark

    2 publications · 32 citations

    2

    h-index

  2. YW
    Yusu Wang

    The Ohio State University, United States

    2 publications · 72 citations

    2

    h-index

  3. BF
    Barış Fi̇dan

    University of Waterloo, Canada

    1 publications · 65 citations

    1

    h-index

  4. JM
    Julien M. Hendrickx

    UCLouvain, Belgium

    1 publications · 65 citations

    1

    h-index

  5. SC
    Sylvain Conchon

    Université Paris-Sud, France

    1 publications · 26 citations

    1

    h-index

1–5 of 39

Venues

  1. Discrete & Computational Geometry

    1 publications · 56 citations

    1

    h-index

  2. IEEE Transactions on Automatic Control

    1 publications · 65 citations

    1

    h-index

  3. BRICS Report Series

    1 publications · 13 citations

    1

    h-index

  4. 1

    h-index

  5. International Conference on Artificial Intelligence and Statistics

    Conference · 1 publications · 16 citations

    1

    h-index

1–5