A note on set union with arbitrary deunions

DOI10.1016/0020-0190(91)90151-7zbMATH Open0714.68039DBLPjournals/ipl/GalilI91OpenAlexW2080432589WikidataQ61609666 ScholiaQ61609666MaRDI QIDQ751279FDOQ751279

Authors: Zvi Galil, Giuseppe F. Italiano 

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

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

zbMATH Keywords

analysis of algorithmsdata structuresdesign of algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

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

Cited In (5)

• Multiple matching of parameterized patterns
• Unifications, deunifications, and their complexity
• Stochastic coalescence in logarithmic time
• Title not available (Why is that?)
• 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)