The set union problem with dynamic weighted backtracking
From MaRDI portal
Publication:804287
DOI10.1007/BF01933257zbMATH Open0727.68040DBLPjournals/bit/GambosiIT91OpenAlexW1970418126WikidataQ59256057 ScholiaQ59256057MaRDI QIDQ804287FDOQ804287
Authors: 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
Recommendations
Combinatorics in computer science (68R05) Data structures (68P05) Logic programming (68N17) Parallel algorithms in computer science (68W10)
Cites Work
- Title not available (Why is that?)
- A class of algorithms which require nonlinear time to maintain disjoint sets
- Efficiency of a Good But Not Linear Set Union Algorithm
- Worst-case Analysis of Set Union Algorithms
- Amortized Computational Complexity
- Worst-case analysis of the set-union problem with extended backtracking
- Title not available (Why is that?)
- A Lower Bound on the Complexity of the Union-Split-Find Problem
- An \(O(EV\log^2V)\) algorithm for the maximal flow problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Depth-m search in branch-and-bound algorithms
- Amortized Analysis of Algorithms for Set Union with Backtracking
Cited In (7)
- Unifications, deunifications, and their complexity
- The Set Union Problem with Unlimited Backtracking
- Worst-case analysis of the set-union problem with extended backtracking
- Amortized Analysis of Algorithms for Set Union with Backtracking
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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)
