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...
| Главные авторы: | , , , , |
|---|---|
| Другие авторы: | |
| Формат: | Статья |
| Язык: | English |
| Опубликовано: |
Society for Industrial & Applied Mathematics (SIAM)
2021
|
| Online-ссылка: | https://hdl.handle.net/1721.1/134507 |