𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An efficient multiway merging algorithm

✍ Scribed by Lijun Zhao; Zhiyong Liu; Qingshi Gao

Book ID
105655765
Publisher
SP Science China Press
Year
1998
Tongue
English
Weight
526 KB
Volume
41
Category
Article
ISSN
1006-9321

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Efficient algorithms for merging
Efficient algorithms for merging
✍ V. S. Alagar; T. D. Bui; Mai Thanh πŸ“‚ Article πŸ“… 1983 πŸ› Springer Netherlands 🌐 English βš– 778 KB
An Improved Approximation Algorithm for
An Improved Approximation Algorithm for MULTIWAY CUT
✍ Gruia CΔƒlinescu; Howard Karloff; Yuval Rabani πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 132 KB

Given an undirected graph with edge costs and a subset of k nodes called terminals, a multiway cut is a subset of edges whose removal disconnects each terminal from the rest. Multiway Cut is the problem of finding a multiway cut of minimum cost. Previously, a very simple combinatorial algorithm due

An algorithm for merging meaps
An algorithm for merging meaps
✍ JΓΆrg -R. Sack; Thomas Strothotte πŸ“‚ Article πŸ“… 1985 πŸ› Springer-Verlag 🌐 English βš– 771 KB
An algorithm for merging meaps
An algorithm for merging meaps
✍ JΓΆrg -R. Sack; Thomas Strothotte πŸ“‚ Article πŸ“… 1985 πŸ› Springer-Verlag 🌐 English βš– 771 KB
Parallel Sorting Algorithm Using Multiwa
Parallel Sorting Algorithm Using Multiway Merge and Its Implementation on a Multi-Mesh Network
✍ Bhabani P. Sinha; Amar Mukherjee πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 288 KB

In this paper, we present a parallel sorting algorithm using the technique of multi-way merge. This algorithm, when implemented on a t dimensional mesh having n t nodes (t>2), sorts n t elements in O((t 2 &3t+2) n) time, thus offering a better order of time complexity than the [((t 2 &t) n log n)Γ‚2+