Memory management for union-find algorithms
type: Item
instance of: scholarly article
title: Memory management for Union-Find algorithms
zbMATH Open document ID: 1498.68088
author: Christophe Fiorio
author: Jens Gustedt
published in: Lecture Notes in Computer Science
publication date: 2022-11-09T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68U10
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 7614457
MaRDI profile type: MaRDI publication profile
full work available at URL: https://doi.org/10.1007/bfb0023449
OpenAlex ID: W1565047750
cites work: A complement to Tarjan's result about the lower bound on the complexity of the set union problem
cites work: A general approach to connected-component labeling for arbitrary image representations
cites work: Two linear time Union--Find strategies for image processing
cites work: Q3138878
cites work: Q3219751
cites work: Q4385511
cites work: Graph minors. I. Excluding a forest
cites work: Efficiency of a Good But Not Linear Set Union Algorithm
cites work: A class of algorithms which require nonlinear time to maintain disjoint sets
cites work: Worst-case Analysis of Set Union Algorithms
cites work: Union-copy structures and dynamic segment trees
DOI: 10.1007/BFB0023449
Recommended article: Two linear time Union--Find strategies for image processing
Recommended article: Probabilistic Analysis of Disjoint Set Union Algorithms
Recommended article: Efficient Union-Find for planar graphs and other sparse graph classes
Recommended article: Fast morphological attribute operations using Tarjan's union-find algorithm.
Recommended article: Concurrent disjoint set union
description: scientific article; zbMATH DE number 7614457