A Class of Merging Algorithms
Work
Year: 1973
Type: article
Abstract: Suppose we are given two disjoint linearly ordered subsets A and B of a linearly ordered set C , say A = { a 1 < a 2 < ··· < a m } and B = { b 1 < b 2 < ··· < b n }. The problem is t... more
Source: Journal of the ACM
Authors F. K. Hwang, Daniel Deutsch
Cites: 3
Cited by: 9
Related to: 10
FWCI:
Open Access status: bronze