Other authors

Ministerio de Ciencia e Innovación (Espanya)

Publication date

info:eu-repo/date/embargoEnd/2026-01-01

info:eu-repo/date/embargoEnd/2026-01-01

2014



Abstract

The extremal sets of a family F of sets consist of all sets of F that are maximal or minimal with respect to the partial order induced by the subset relation in F. In this paper we present efficient parallel GPU-based algorithms, designed under CUDA architecture, for finding the extremal sets of a family F of sets. The complexity analysis of the presented algorithms together with experimental results showing the efficiency and scalability of the approach is provided


This work was partially supported by the Spanish Ministerio de Ciencia e Innovacion under grant TIN2010-20590-C02-02

Document Type

Article


Published version

Language

English

Publisher

Elsevier

Related items

info:eu-repo/semantics/altIdentifier/doi/10.1016/j.jpdc.2013.07.004

info:eu-repo/semantics/altIdentifier/issn/0743-7315

info:eu-repo/grantAgreement/MICINN//TIN2010-20590-C02-02/ES/AVANCES EN REALIDAD VIRTUAL PARA APLICACIONES PUNTERAS-UDG/

Recommended citation

This citation was generated automatically.

Rights

Tots els drets reservats

This item appears in the following Collection(s)