A note on set union with arbitrary deunions

DOI10.1016/0020-0190(91)90151-7MaRDI QIDQ751279zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Zvi Galil, Giuseppe F. Italiano

Publication date 1991

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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)

Recommendations

• scientific article; zbMATH DE number 4062625
• scientific article; zbMATH DE number 3960991
• The Set Union Problem with Unlimited Backtracking
• The set union problem with dynamic weighted backtracking
• Union-find with constant time deletions

Cites work

• scientific article; zbMATH DE number 4062625 (Why is no real title available?)
• A Lower Bound on the Complexity of the Union-Split-Find Problem
• A class of algorithms which require nonlinear time to maintain disjoint sets
• Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
• Efficiency of a Good But Not Linear Set Union Algorithm
• Parallel concepts in graph theory
• Worst-case Analysis of Set Union Algorithms
• Worst-case analysis of the set-union problem with extended backtracking

Cited in

(5)

• Multiple matching of parameterized patterns
• Unifications, deunifications, and their complexity
• Stochastic coalescence in logarithmic time
• scientific article; zbMATH DE number 4062625 (Why is no real title available?)
• Data structures for two-edge connectivity in planar graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751279)