The set union problem with dynamic weighted backtracking
From MaRDI portal
Publication:804287
DOI10.1007/BF01933257zbMath0727.68040WikidataQ59256057 ScholiaQ59256057MaRDI QIDQ804287
Giorgio Gambosi, Maurizio Talamo, Giuseppe F. Italiano
Publication date: 1991
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01933257
68R05: Combinatorics in computer science
68W10: Parallel algorithms in computer science
68P05: Data structures
68N17: Logic programming
Related Items
Cites Work
- A class of algorithms which require nonlinear time to maintain disjoint sets
- Worst-case analysis of the set-union problem with extended backtracking
- An \(O(EV\log^2V)\) algorithm for the maximal flow problem
- Amortized Computational Complexity
- Worst-case Analysis of Set Union Algorithms
- A Lower Bound on the Complexity of the Union-Split-Find Problem
- Efficiency of a Good But Not Linear Set Union Algorithm
- Depth-m search in branch-and-bound algorithms
- Amortized Analysis of Algorithms for Set Union with Backtracking
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item