article

An old sub-quadratic algorithm for finding extremal sets

Author:

Paul PritchardAuthors Info & Claims

Information Processing Letters, Volume 62, Issue 6

Pages 329 - 334

https://doi.org/10.1016/S0020-0190(97)00084-7

Published: 27 June 1997 Publication History

Abstract

No abstract available.

Cited By

View all

Backes TDietze S(2024)Connected Components for Scaling Partial-order Blocking to Billion EntitiesJournal of Data and Information Quality10.1145/364655316:1(1-29)Online publication date: 19-Mar-2024
https://dl.acm.org/doi/10.1145/3646553
Backes THienert DDietze S(2022)Towards hierarchical affiliation resolution: framework, baselines, datasetInternational Journal on Digital Libraries10.1007/s00799-022-00326-123:3(267-288)Online publication date: 1-Sep-2022
https://dl.acm.org/doi/10.1007/s00799-022-00326-1
Boissonnat JKarthik CKlein P(2017)An efficient representation for filtrations of simplicial complexesProceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3039686.3039865(2705-2720)Online publication date: 16-Jan-2017
https://dl.acm.org/doi/10.5555/3039686.3039865
Show More Cited By

Index Terms

An old sub-quadratic algorithm for finding extremal sets
1. Mathematics of computing
  1. Discrete mathematics
  2. Mathematical software
2. Theory of computation
  1. Randomness, geometry and discrete structures

Recommendations

Finding extremal sets on the GPU

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 ...
Practical Algorithms for Finding Extremal Sets
Special Issue SEA 2014, Regular Papers and Special Issue ALENEX 2013

The minimal sets within a collection of sets are defined as the ones that do not have a proper subset within the collection, and the maximal sets are the ones that do not have a proper superset within the collection. Identifying extremal sets is a ...
A simple sub-quadratic algorithm for computing the subset partial order

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Information Processing Letters Volume 62, Issue 6

June 27, 1997

50 pages

ISSN:0020-0190

Editors:
F. Dehne
Carleton Univ., Ottawa, Canada
,
D. Gries
Cornell Univ., Ithaca, NY
,
W. M. Turski
Warsaw Univ., Warsaw, Poland

Issue’s Table of Contents

Publisher

Elsevier North-Holland, Inc.

United States

Publication History

Published: 27 June 1997

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 19 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Backes TDietze S(2024)Connected Components for Scaling Partial-order Blocking to Billion EntitiesJournal of Data and Information Quality10.1145/364655316:1(1-29)Online publication date: 19-Mar-2024
https://dl.acm.org/doi/10.1145/3646553
Backes THienert DDietze S(2022)Towards hierarchical affiliation resolution: framework, baselines, datasetInternational Journal on Digital Libraries10.1007/s00799-022-00326-123:3(267-288)Online publication date: 1-Sep-2022
https://dl.acm.org/doi/10.1007/s00799-022-00326-1
Boissonnat JKarthik CKlein P(2017)An efficient representation for filtrations of simplicial complexesProceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3039686.3039865(2705-2720)Online publication date: 16-Jan-2017
https://dl.acm.org/doi/10.5555/3039686.3039865
Marinov MNash NGregg D(2016)Practical Algorithms for Finding Extremal SetsACM Journal of Experimental Algorithmics10.1145/289318421(1-21)Online publication date: 5-Apr-2016
https://dl.acm.org/doi/10.1145/2893184
Elmasry A(2012)On the size of the subset partial orderInformation Processing Letters10.1016/j.ipl.2012.03.005112:12(487-489)Online publication date: 1-Jun-2012
https://dl.acm.org/doi/10.1016/j.ipl.2012.03.005
Elmasry A(2010)The subset partial orderProceedings of the Meeting on Algorithm Engineering & Expermiments10.5555/2790381.2790385(27-33)Online publication date: 16-Jan-2010
https://dl.acm.org/doi/10.5555/2790381.2790385

Abstract

Cited By

Index Terms

Recommendations

Finding extremal sets on the GPU

Practical Algorithms for Finding Extremal Sets

A simple sub-quadratic algorithm for computing the subset partial order

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations