A note on the 1-maximal elements problem
Eleanor M. Pigli · International Journal of Computer Mathematics · 1993
Consider a set of S points in the plane. A point p in S is said to be k-maximal if exactly k elements in S dominate p. We propose a very simple, cost-optimal, EREW algorithm to solve the 1-maximal elements problem in the plane.