Recommendations
Cites work
- scientific article; zbMATH DE number 4062625 (Why is no real title available?)
- A Lower Bound on the Complexity of the Union-Split-Find Problem
- A class of algorithms which require nonlinear time to maintain disjoint sets
- Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
- Efficiency of a Good But Not Linear Set Union Algorithm
- Parallel concepts in graph theory
- Worst-case Analysis of Set Union Algorithms
- Worst-case analysis of the set-union problem with extended backtracking
Cited in
(5)
This page was built for publication: A note on set union with arbitrary deunions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751279)