Set Merging Algorithms
From MaRDI portal
Cited in
(22)- On-line computation of transitive closures of graphs
- A linear-time algorithm for a special case of disjoint set union
- Worst-case analysis of the set-union problem with extended backtracking
- Ranking arborescences in O(Km log n) time
- Testing flow graph reducibility
- A new data structure for the UNION-FIND problem
- An asymmetric multi-item auction with quantity discounts applied to Internet service procurement in Buenos Aires public schools
- Modified classical graph algorithms for the DNA fragment assembly problem
- Aggregation-based minimization of finite state automata
- Concurrent disjoint set union
- Range minimum queries in minimal space
- Comparative study and proof of single-pass connected components algorithms
- Machine-checked verification of the correctness and amortized complexity of an efficient union-find implementation
- ALGORITHMS FOR K-DISJOINT MAXIMUM SUBARRAYS
- A partially persistent data structure for the set-union problem
- Finding all door locations that make a room searchable
- Design and implementation of an efficient priority queue
- Minimization of finite state automata through partition aggregation
- A class of algorithms which require nonlinear time to maintain disjoint sets
- On efficient algorithms for bottleneck path problems with many sources
- Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits
- Finding conflict-free minimum weight spanning trees using maximal stable sets of the conflict graph
This page was built for publication: Set Merging Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5667466)
