The set union problem with dynamic weighted backtracking
- 1 September 1991
- journal article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 31 (3) , 381-393
- https://doi.org/10.1007/bf01933257
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Getting back to the past in the union-find problemPublished by Springer Nature ,2006
- Data structures and algorithms for disjoint set union problemsACM Computing Surveys, 1991
- Worst-case analysis of the set-union problem with extended backtrackingTheoretical Computer Science, 1989
- The cell probe complexity of dynamic data structuresPublished by Association for Computing Machinery (ACM) ,1989
- Time parameter and arbitrary deunions in the set union problemPublished by Springer Nature ,1988
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- The set union problem with backtrackingPublished by Springer Nature ,1986
- Worst-case Analysis of Set Union AlgorithmsJournal of the ACM, 1984
- An O(EVIog2V) algorithm for the maximal flow problemJournal of Computer and System Sciences, 1980
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975