Leigh R. Power
- 1 BRoN, C. Algorithm 426 merge sort algorithm. Comm. A CM 15, 5 (May 1972), 357-358. Google Scholar
- 2 BURGE, W.H. Sorting, trees, and measures of order. Inform. Contr. 1 (Sept. 1958), 181-197.Google Scholar
- 3 MORRm, R. Some theorems on sorting. SIAM J. Appl. Math. 17 (Jan. 1969), 1-6.Google Scholar
- 4 WOODALL, A.D. Algorithm 45 an internal sorting procedure using a two-way merge. The Computer J. 13 (Feb. 1970), 110-111.Google Scholar
- 5 WOODRUM, L.J. Internal sorting with mmimal companng. IBM Syst. J. 8 (1969), 189-203.Google Scholar
Index Terms
- Internal Sorting Using a Minimal Tree Merge Strategy
Recommendations
Approximating the selected-internal Steiner tree
In this paper, we consider a variant of the well-known Steiner tree problem. Given a complete graph G=(V,E) with a cost function c:E->R^+ and two subsets R and R^' satisfying R^'@?R@?V, a selected-internal Steiner tree is a Steiner tree which contains (...
The internal Steiner tree problem: Hardness and approximations
Given a graph G=(V,E) with a cost function c:E->R^+ and a vertex subset R@__ __V, an internal Steiner tree is a Steiner tree that contains all the vertices in R, and such that each vertex in R must be an internal vertex. The internal Steiner tree ...
A new algorithm using the non-dominated tree to improve non-dominated sorting
Non-dominated sorting is a technique often used in evolutionary algorithms to determine the quality of solutions in a population. The most common algorithm is the Fast Non-dominated Sort FNS. This algorithm, however, has the drawback that its ...
Comments