期刊
THEORETICAL COMPUTER SCIENCE
卷 845, 期 -, 页码 76-97出版社
ELSEVIER
DOI: 10.1016/j.tcs.2020.09.004
关键词
Graph algorithms; Topological sort; Sorting algorithms; Comparison graphs
资金
- UC Regents Scholarship
The quest for efficient sorting is ongoing, and we will explore a graph-based stable sorting strategy, in particular employing comparison graphs. We use the topological sort to map the comparison graph to a linear domain, and we can manipulate our graph such that the resulting topological sort is the sorted array. By taking advantage of the many relations between Hamiltonian paths and topological sorts in comparison graphs, we design a Divide-and-Conquer algorithm that runs in the optimal O(n logn) time. In the process, we construct a new merge process for graphs with relevant invariant properties for our use. Furthermore, this method is more space-efficient than the famous MERGESORT since we modify our fixed graph only. (C) 2020 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据