On the size of the subset partial order

DOI10.1016/j.ipl.2012.03.005zbMath1243.05236OpenAlexW2092376337MaRDI QIDQ436580

Amr Elmasry

Publication date: 25 July 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.03.005

zbMATH Keywords

combinatorial problemsextremal combinatoricspartial ordercounting argumentssubset graph

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics of partially ordered sets (06A07) Enumeration in graph theory (05C30) Extremal set theory (05D05) Graph theory (05C99)

Related Items (1)

Computing the subset partial order for dense families of sets

Cites Work

• Unnamed Item
• An old sub-quadratic algorithm for finding extremal sets
• A simple sub-quadratic algorithm for computing the subset partial order
• Opportunistic algorithms for eliminating supersets
• Computing the subset partial order for dense families of sets
• A fast bit-parallel algorithm for computing the subset partial order
• Finding extremal sets in less than quadratic time
• Fast sequential and parallel algorithms for finding extremal sets
• On Computing the Subset Graph of a Collection of Sets
• The Subset Partial Order: Computing and Combinatorics

This page was built for publication: On the size of the subset partial order