The thesis describes how to achieve partial and full persitence
for graph data structures of bounded degree. It describes and
analyzes a randomized approach. Further it provides a framework
for making C++ data structures partially persistent.
The framework is used for constructing a partially persistent
dictionary based on red-black trees, which is used for point
location in planar subdivisions and voronoi diagrams.
![]() | Editor(s) Sven Thiel | Created 02/22/2000 10:08:27 AM |
Revisions 3. 2. 1. 0. | Editor(s) Sven Thiel Sven Thiel Sven Thiel Sven Thiel | Edit Dates 22/02/2000 10:18:15 22/02/2000 10:16:46 22/02/2000 10:14:56 22/02/2000 10:08:31 |