Fully persistent data structures for disjoint set union problems
From MaRDI portal
Recommendations
Cited in
(8)- A space efficient variant of path copying for partially persistent sorted sets
- Nested set union
- A partially persistent data structure for the set-union problem
- scientific article; zbMATH DE number 4050989 (Why is no real title available?)
- Persistence, randomization and parallelization: On some combinatorial games and their applications (abstract)
- Union-find with constant time deletions
- Storing set families more compactly with top ZDDs
- A note on data structures for maintaining bipartitions
This page was built for publication: Fully persistent data structures for disjoint set union problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4037440)