
The authors present an algorithm that efficiently recovers the linear order on a set of elements given a partial order and a linear order oracle, using subquadratic preprocessing time and optimal query time.


coremsg

efficient-algorithms-for-sorting-under-partial-information


Efficient Algorithms for Sorting Under Partial Information


title_rewrite


A simple and efficient algorithm for sorting a set of items with an unknown total order by performing binary comparisons, given the outcomes of some pre-existing comparisons.


efficient-sorting-of-partially-ordered-items-using-topological-heapsort


Efficient Sorting of Partially Ordered Items Using Topological Heapsort
