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
Parents
16
Time-varying reeb graphs for continuous space-time data
Herbert Edelsbrunner, John Harer, Ajith Mascarenhas et al. · 2004 · 74 citations
Ethereum transaction graph analysis
Wren Chan, Aspen Olmsted · 2017 · 71 citations
Reeb Graphs: Approximation and Persistence
Tamal K. Dey, Yusu Wang · Discrete & Computational Geometry · 2012 · 56 citations · Full text
HiDeF: identifying persistent structures in multiscale ‘omics data
Fan Zheng, She Zhang, Christopher Churas et al. · Genome biology · 2021 · 51 citations · Full text
1–5 of 16
39
2
h-index
2
h-index
1
h-index
1
h-index
1
h-index
1–5 of 39
24

Aarhus University
Aarhus, Denmark
2 h-index
2 publications
32 citations
The Ohio State University
Columbus, United States
2 h-index
4 publications
144 citations
Université Paris-Sud
Orsay, France
1 h-index
2 publications
52 citations
University of North Carolina at Chapel Hill
Chapel Hill, United States
1 h-index
1 publications
74 citations

National Institute of Technology Calicut
Kozhikode, India
1 h-index
3 publications
51 citations

Australian National University
Canberra, Australia
1 h-index
3 publications
195 citations

Lawrence Livermore National Laboratory
Livermore, United States
1 h-index
1 publications
74 citations
Georgia Institute of Technology
Atlanta, United States
1 h-index
4 publications
188 citations
1–8 of 24
1 publications · 56 citations
1
h-index
1 publications · 65 citations
1
h-index
1 publications · 13 citations
1
h-index
Repository · 1 publications · 15 citations
1
h-index
Conference · 1 publications · 16 citations
1
h-index
1–5