A partially persistent data structure for the set-union problem

DOI10.1051/ita/1990240201891zbMath0701.68021OpenAlexW85691910MaRDI QIDQ3479514

Giorgio Gambosi, Maurizio Talamo, Carlo Gaibisso

Publication date: 1990

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92355

zbMATH Keywords

worst case complexitydata structureSet-Union problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Data structures (68P05)

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A class of algorithms which require nonlinear time to maintain disjoint sets
• A linear-time algorithm for a special case of disjoint set union
• Making data structures persistent
• Worst-case analysis of the set-union problem with extended backtracking
• Amortized Computational Complexity
• Worst-case Analysis of Set Union Algorithms
• Efficiency of a Good But Not Linear Set Union Algorithm
• Amortized Analysis of Algorithms for Set Union with Backtracking
• An improved equivalence algorithm
• Set Merging Algorithms

This page was built for publication: A partially persistent data structure for the set-union problem