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
Decomposing DAGs into disjoint chains
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
On the complexity of searching in trees: average-case minimization
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Instantiation-based invariant discovery
NFM'11 Proceedings of the Third international conference on NASA Formal methods
LRM-trees: compressed indices, adaptive sorting, and compressed permutations
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Searching in dynamic tree-like partial orders
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
On the complexity of searching in trees and partially ordered structures
Theoretical Computer Science
Highly scalable multiprocessing algorithms for preference-based database retrieval
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
Representing and reasoning with qualitative preferences for compositional systems
Journal of Artificial Intelligence Research
Modular first-order ontologies via repositories
Applied Ontology - Modularity in Ontologies
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Class hierarchy complementation: soundly completing a partial type graph
Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications
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 optimal query complexity O(n(w + log n)). We also describe a variant of Mergesort with query complexity O(wn log n/w) and total complexity O(w2n log 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 O(wn) query and total complexity. 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.