The following pages link to Set Merging Algorithms (Q5667466):
Displaying 21 items.
- A class of algorithms which require nonlinear time to maintain disjoint sets (Q598809) (← links)
- Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits (Q670699) (← links)
- On-line computation of transitive closures of graphs (Q1051432) (← links)
- A linear-time algorithm for a special case of disjoint set union (Q1062461) (← links)
- Worst-case analysis of the set-union problem with extended backtracking (Q1124334) (← links)
- Ranking arborescences in O(Km log n) time (Q1142709) (← links)
- Testing flow graph reducibility (Q1221484) (← links)
- A new data structure for the UNION-FIND problem (Q1256854) (← links)
- An asymmetric multi-item auction with quantity discounts applied to Internet service procurement in Buenos Aires public schools (Q1686513) (← links)
- Modified classical graph algorithms for the DNA fragment assembly problem (Q1736710) (← links)
- Aggregation-based minimization of finite state automata (Q2035006) (← links)
- Concurrent disjoint set union (Q2064053) (← links)
- Range minimum queries in minimal space (Q2078612) (← links)
- Comparative study and proof of single-pass connected components algorithms (Q2331087) (← links)
- Machine-Checked Verification of the Correctness and Amortized Complexity of an Efficient Union-Find Implementation (Q2945628) (← links)
- ALGORITHMS FOR K-DISJOINT MAXIMUM SUBARRAYS (Q3434278) (← links)
- A partially persistent data structure for the set-union problem (Q3479514) (← links)
- FINDING ALL DOOR LOCATIONS THAT MAKE A ROOM SEARCHABLE (Q3562853) (← links)
- Design and implementation of an efficient priority queue (Q4137890) (← links)
- Minimization of Finite State Automata Through Partition Aggregation (Q5738999) (← links)
- On efficient algorithms for bottleneck path problems with many sources (Q6542462) (← links)
