ON COST-OPTIMAL MERGE OF TWO INTRANSITIVE SORTED SEQUENCES

DOI10.1142/S0129054103001613zbMath1099.68133MaRDI QIDQ5696895

Jie Wu, Unnamed Author

Publication date: 19 October 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

sortingtournamentPRAMHamiltonian pathmerging

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Cites Work

• An efficient sorting algorithm for a sequence of kings in a tournament.
• The complexity of finding generalized paths in tournaments
• Fast parallel algorithms for finding hamiltonian paths and cycles in a tournament
• Parallel Merge Sort
• Sorting, Minimal Feedback Sets, and Hamilton Paths in Tournaments

This page was built for publication: ON COST-OPTIMAL MERGE OF TWO INTRANSITIVE SORTED SEQUENCES