Computing the subset partial order for dense families of sets
type: Item
instance of: scholarly article
title: Computing the subset partial order for dense families of sets
zbMATH Open document ID: 1202.68473
author: Amr Elmasry
published in: Information Processing Letters
publication date: 2010-08-20T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 5773857
zbMATH Keywords: algorithms
zbMATH Keywords: algorithm design and analysis
zbMATH Keywords: data structures
MaRDI profile type: Publication
full work available at URL: j.ipl.2009.07.001
OpenAlex ID: W2011719343
cites work: On the size of the subset partial order
cites work: A fast bit-parallel algorithm for computing the subset partial order
cites work: On Computing the Subset Graph of a Collection of Sets
cites work: An old sub-quadratic algorithm for finding extremal sets
cites work: A simple sub-quadratic algorithm for computing the subset partial order
cites work: Opportunistic algorithms for eliminating supersets
cites work: Fully dynamic algorithms for maintaining extremal sets in a family of sets∗
cites work: Fast sequential and parallel algorithms for finding extremal sets
cites work: Finding extremal sets in less than quadratic time
cites work: Q4763424
DOI: 10.1016/J.IPL.2009.07.001
description: scientific article; zbMATH DE number 5773857