October 1, 1975Open Access

On Finding the Maxima of a Set of Vectors

Key Points

Key points are not available for this paper at this time.

Abstract

ASSTRACT. Let U1 , U2, . . . , Ud be totally ordered sets and let V be a set of n d-dimensional vectors In U~ X Us. . X Ud . A partial ordering is defined on V in a natural way The problem of finding all maximal elements of V with respect to the partial ordering ~s considered The computational complexity of the problem is defined to be the number of required comparisons of two components and

Connected Papers

Building similarity graph...

Analyzing shared references across papers

Discussion

Cite this study

Kung et al. (Wed,) studied this question.

synapsesocial.com/papers/69df2b7dde200760a86148be — DOI: https://doi.org/10.1145/321906.321910

Also consider

Synapse has enriched one closely related paper. Consider it for comparative context:

The Art of Computer Programming: Volume 3: Sorting and Searching· 1973 · 3,977 citations

Authors

H. T. Kung

National Pingtung University of Science and Technology

Fabrizio Luccio

University of Pisa

F. P. Preparata

Liceo scientifico statale Ulisse Dini

Journals

Journal of the ACM

Actions

Institutions

University of Illinois Urbana-Champaign

Carnegie Mellon University

University of Pisa

References and Citations

Connected Papers

Building similarity graph...

Analyzing shared references across papers

On Finding the Maxima of a Set of Vectors

Key Points

Abstract

Citation Network

Connected Papers

Discussion

Cite this study

Also consider

Authors

Journals

Actions

Institutions

References and Citations

Citation Network

Connected Papers

Discussion

Also consider