Memory management for union-find algorithms

DOI10.1007/BFB0023449MaRDI QIDQ5047160zbMATH OpenOpenAlexFDO

Authors Christophe Fiorio, Jens Gustedt

Publication date 9 November 2022

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bfb0023449

Mathematics Subject Classification ID

Data structures (68P05) Computing methodologies for image processing (68U10) Analysis of algorithms (68W40)

Recommendations

• Two linear time Union--Find strategies for image processing
• Probabilistic Analysis of Disjoint Set Union Algorithms
• Efficient Union-Find for planar graphs and other sparse graph classes
• Fast morphological attribute operations using Tarjan's union-find algorithm.
• Concurrent disjoint set union

Cites work

• A class of algorithms which require nonlinear time to maintain disjoint sets
• A complement to Tarjan's result about the lower bound on the complexity of the set union problem
• A general approach to connected-component labeling for arbitrary image representations
• Efficiency of a Good But Not Linear Set Union Algorithm
• Graph minors. I. Excluding a forest
• scientific article; zbMATH DE number 432750 (Why is no real title available?)
• scientific article; zbMATH DE number 3887059 (Why is no real title available?)
• scientific article; zbMATH DE number 1142295 (Why is no real title available?)
• Two linear time Union--Find strategies for image processing
• Union-copy structures and dynamic segment trees
• Worst-case Analysis of Set Union Algorithms

Cited in

(5)

• Efficient Union-Find for planar graphs and other sparse graph classes
• Fast morphological attribute operations using Tarjan's union-find algorithm.
• Memory-Efficient Algorithms for Finding Needles in Haystacks
• Efficient union-find for planar graphs and other sparse graph classes (extended abstract)
• Two linear time Union--Find strategies for image processing

This page was built for publication: Memory management for union-find algorithms

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