scientific article; zbMATH DE number 742985

MaRDI QIDQ4763424zbMATH OpenFDO

Authors Daniel Yellin

Publication date 11 April 1995

zbMATH Keywords

maximal setssubset testing

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99) Parallel algorithms in computer science (68W10)

Recommendations

• Finding extremal sets in less than quadratic time
• A Linear Time Approach to the Set Maxima Problem
• An old sub-quadratic algorithm for finding extremal sets
• A simple sub-quadratic algorithm for computing the subset partial order
• Computing the subset partial order for dense families of sets

Cited in

(16)

• Finding extremal sets in less than quadratic time
• Lazy structure sharing for query optimization
• Lower bounds for set intersection queries
• Precise estimates for the time complexity of implementing algorithms of set-theoretic operations in table algebras
• Building efficient and compact data structures for simplicial complexes
• Fast sequential and parallel algorithms for finding extremal sets
• A Linear Time Approach to the Set Maxima Problem
• Representing sets with constant time equality testing
• Fully dynamic algorithms for maintaining extremal sets in a family of sets^∗
• On the size of the subset partial order
• Data structures for maintaining set partitions
• Minimum violation vertex maps and their applications to cut problems
• On the complexity of strongly connected components in directed hypergraphs
• Practical algorithms for finding extremal sets
• Opportunistic algorithms for eliminating supersets
• Computing the subset partial order for dense families of sets

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4763424)