Skip to Main content Skip to Navigation
Journal articles

Determining Plurality

Laurent Alonso 1 Edward M. Reingold 2
1 ALICE - Geometry and Lighting
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : Given a set of $n$ elements, each of which is colored one of $c$ colors, we must determine an element of the plurality (most frequently occurring) color by pairwise equal/unequal color comparisons of elements. We prove that $(c-1)(n-c)/2$ color comparisons are necessary in the worst case to determine the plurality color and give an algorithm requiring $(0.775 c + 5.9)n + O(c^2)$ color comparisons for $c \geq 9$.
Document type :
Journal articles
Complete list of metadata
Contributor : Laurent Alonso Connect in order to contact the contributor
Submitted on : Sunday, September 2, 2007 - 9:04:28 AM
Last modification on : Friday, February 26, 2021 - 3:28:08 PM




Laurent Alonso, Edward M. Reingold. Determining Plurality. ACM Transactions on Algorithms, Association for Computing Machinery, 2008, 4 (3), pp.26:1,26:19. ⟨10.1145/1367064.1367066⟩. ⟨inria-00169184⟩



Record views