The set union problem with dynamic weighted backtracking
From MaRDI portal
Recommendations
Cites work
- 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 3511563 (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
- Amortized Analysis of Algorithms for Set Union with Backtracking
- Amortized Computational Complexity
- An \(O(EV\log^2V)\) algorithm for the maximal flow problem
- Depth-m search in branch-and-bound algorithms
- Efficiency of a Good But Not Linear Set Union Algorithm
- Worst-case Analysis of Set Union Algorithms
- Worst-case analysis of the set-union problem with extended backtracking
Cited in
(7)- scientific article; zbMATH DE number 3960991 (Why is no real title available?)
- scientific article; zbMATH DE number 4050989 (Why is no real title available?)
- Amortized Analysis of Algorithms for Set Union with Backtracking
- Worst-case analysis of the set-union problem with extended backtracking
- Unifications, deunifications, and their complexity
- The Set Union Problem with Unlimited Backtracking
- A note on set union with arbitrary deunions
This page was built for publication: The set union problem with dynamic weighted backtracking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804287)
