Sorting and recognition problems for ordered sets
SIAM Journal on Computing
A random polynomial-time algorithm for approximating the volume of convex bodies
Journal of the ACM (JACM)
Counting linear extensions is #P-complete
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Elements of information theory
Elements of information theory
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Balanced pairs in partial orders
Discrete Mathematics - Special issue on partial ordered sets
A Counting Approach to Lower Bounds for Selection Problems
Journal of the ACM (JACM)
Generalization of Binary Search: Searching in Trees and Forest-Like Partial Orders
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Pictures from Mongolia: partial sorting in a partial world
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
Compact representation of posets
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Hi-index | 0.00 |
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study these problems in the context of partially ordered sets, in which some pairs of objects are incomparable. This generalization is interesting from a combinatorial perspective, and it has immediate applications in ranking scenarios where there is no underlying linear ordering, e.g., conference submissions. It also has applications in reconstructing certain types of networks, including biological networks. Our results represent significant progress over previous results from two decades ago by Faigle and Turán. In particular, we present the first algorithm that sorts a width-$w$ poset of size $n$ with query complexity $O(n(w+\log n))$ and prove that this query complexity is asymptotically optimal. We also describe a variant of Mergesort with query complexity $O(wn\log\frac{n}{w})$ and total complexity $O(w^{2}n\log\frac{n}{w})$; an algorithm with the same query complexity was given by Faigle and Turán, but no efficient implementation of that algorithm is known. Both our sorting algorithms can be applied with negligible overhead to the more general problem of reconstructing transitive relations. We also consider two related problems: finding the minimal elements, and its generalization to finding the bottom $k$ “levels,” called the $k$-selection problem. We give efficient deterministic and randomized algorithms for finding the minimal elements with query complexity and total complexity $O(wn)$. We provide matching lower bounds for the query complexity up to a factor of 2 and generalize the results to the $k$-selection problem. Finally, we present efficient algorithms for computing a linear extension of a poset and computing the heights of all elements.