Fast sequential and parallel algorithms for finding extremal sets

DOI10.1080/00207169608804512zbMath1001.68973OpenAlexW2115607591MaRDI QIDQ2710788

Hong Shen, David J. Evans

Publication date: 19 December 2002

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169608804512

zbMATH Keywords

algorithmspartial orderset inclusionextremal setword-to-bit mapping

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (3)

On the size of the subset partial order ⋮ Computing the subset partial order for dense families of sets ⋮ Practical Algorithms for Finding Extremal Sets

Cites Work

• Unnamed Item
• Opportunistic algorithms for eliminating supersets
• Improved nonconservative sequential and parallel integer sorting
• Parallel computation and conflicts in memory access
• An almost optimal algorithm for unbounded searching
• Finding extremal sets in less than quadratic time
• Searching, Merging, and Sorting in Parallel Computation
• Parallel Merge Sort
• Representing sets with constant time equality testing
• On Computing the Subset Graph of a Collection of Sets
• Algorithms and Data Structures

This page was built for publication: Fast sequential and parallel algorithms for finding extremal sets