On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem
From MaRDI portal
Publication:3756517
DOI10.1137/0215072zbMath0619.68039MaRDI QIDQ3756517
Publication date: 1986
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0215072
68Q25: Analysis of algorithms and problem complexity
Related Items
Efficient algorithms for the temporal precedence problem, Worst-case analysis of the set-union problem with extended backtracking, Maintaining bridge-connected and biconnected components on-line, A lower bound on the single-operation worst-case time complexity of the union-find problem on intervals, Intersection reporting on two collections of disjoint sets, An optimal data structure to handle dynamic environments in non-deterministic computations, On the succinct representation of equivalence classes, Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem