scientific article; zbMATH DE number 742985

zbMath0829.68067MaRDI QIDQ4763424

Daniel M. Yellin

Publication date: 11 April 1995

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

maximal setssubset testing

Mathematics Subject Classification ID

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

Related Items (12)

Fully dynamic algorithms for maintaining extremal sets in a family of sets^∗ ⋮ Lazy structure sharing for query optimization ⋮ Data structures for maintaining set partitions ⋮ Lower bounds for set intersection queries ⋮ Building efficient and compact data structures for simplicial complexes ⋮ On the size of the subset partial order ⋮ Fast sequential and parallel algorithms for finding extremal sets ⋮ Minimum Violation Vertex Maps and Their Applications to Cut Problems ⋮ On the complexity of strongly connected components in directed hypergraphs ⋮ Computing the subset partial order for dense families of sets ⋮ Finding extremal sets in less than quadratic time ⋮ Practical Algorithms for Finding Extremal Sets

This page was built for publication: