A note on set union with arbitrary deunions

DOI10.1016/0020-0190(91)90151-7zbMath0714.68039DBLPjournals/ipl/GalilI91OpenAlexW2080432589WikidataQ61609666 ScholiaQ61609666MaRDI QIDQ751279

Giuseppe F. Italiano, Zvi Galil

Publication date: 1991

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90151-7

zbMATH Keywords

analysis of algorithmsdata structuresdesign of algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (3)

Data structures for two-edge connectivity in planar graphs ⋮ Multiple matching of parameterized patterns ⋮ Unnamed Item

Cites Work

• A class of algorithms which require nonlinear time to maintain disjoint sets
• Worst-case analysis of the set-union problem with extended backtracking
• Parallel concepts in graph theory
• Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
• 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
• Unnamed Item

This page was built for publication: A note on set union with arbitrary deunions