The Set Union Problem with Unlimited Backtracking
From MaRDI portal
Recommendations
Cited in
(15)- Worst-case analysis of the set-union problem with extended backtracking
- Nested set union
- A partially persistent data structure for the set-union problem
- Postorder Disjoint Set Union is Linear
- scientific article; zbMATH DE number 3960991 (Why is no real title available?)
- scientific article; zbMATH DE number 4050989 (Why is no real title available?)
- scientific article; zbMATH DE number 4062625 (Why is no real title available?)
- scientific article; zbMATH DE number 177569 (Why is no real title available?)
- Amortized Analysis of Algorithms for Set Union with Backtracking
- scientific article; zbMATH DE number 2119640 (Why is no real title available?)
- Union-find with constant time deletions
- Automata, Languages and Programming
- A simple and efficient union-find-delete algorithm
- A note on set union with arbitrary deunions
- The set union problem with dynamic weighted backtracking
This page was built for publication: The Set Union Problem with Unlimited Backtracking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4286228)