Title of article
Finding the maximum and minimum elements with one lie Original Research Article
Author/Authors
D?niel Gerbner، نويسنده , , D?m?t?r P?lv?lgyi، نويسنده , , Bal?zs Patk?s، نويسنده , , Gabor Wiener، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
8
From page
988
To page
995
Abstract
In this paper we deal with the problem of finding the smallest and the largest elements of a totally ordered set of size image using pairwise comparisons if one of the comparisons might be erroneous and prove a conjecture of Aigner stating that the minimum number of comparisons needed is image for some constant image. We also address some related problems.
Keywords
Search , Erroneous information , Sorting
Journal title
Discrete Applied Mathematics
Serial Year
2010
Journal title
Discrete Applied Mathematics
Record number
887414
Link To Document