The set union problem with dynamic weighted backtracking

DOI10.1007/BF01933257zbMath0727.68040OpenAlexW1970418126WikidataQ59256057 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

zbMATH Keywords

space complexitylogic programming memory managementset union problem

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Parallel algorithms in computer science (68W10) Data structures (68P05) Logic programming (68N17)

Related Items

Worst-case analysis of the set-union problem with extended backtracking

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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