Amortized Analysis of Algorithms for Set Union with Backtracking
From MaRDI portal
Publication:4729325
DOI10.1137/0218001zbMath0679.68039OpenAlexW1967459785MaRDI QIDQ4729325
Jeffery Westbrook, Robert Endre Tarjan
Publication date: 1989
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0218001
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)
Related Items (4)
A partially persistent data structure for the set-union problem ⋮ Worst-case analysis of the set-union problem with extended backtracking ⋮ Unifications, deunifications, and their complexity ⋮ The set union problem with dynamic weighted backtracking
This page was built for publication: Amortized Analysis of Algorithms for Set Union with Backtracking