Sorting and Selection in Posets

Sorting and Selection in Posets

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 pe...

Full description

Bibliographic Details
Main Authors: Daskalakis, Constantinos, Karp, Richard M, Mossel, Elchanan, Riesenfeld, Samantha J, Verbin, Elad
Other Authors: Massachusetts Institute of Technology. Department of Mathematics
Format: Article
Language:English
Published: Society for Industrial & Applied Mathematics (SIAM) 2021
Online Access:https://hdl.handle.net/1721.1/134507

Internet

https://hdl.handle.net/1721.1/134507

Similar Items