Fully dynamic algorithms for maintaining extremal sets in a family of sets∗

DOI10.1080/00207169808804719zbMath0946.68115OpenAlexW2087802548MaRDI QIDQ4256125

Hong Shen

Publication date: 17 October 2000

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

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

zbMATH Keywords

extremal sets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Extremal set theory (05D05) Discrete mathematics in relation to computer science (68R99)

Related Items (1)

Computing the subset partial order for dense families of sets

Cites Work

• Unnamed Item
• Opportunistic algorithms for eliminating supersets
• Finding extremal sets in less than quadratic time
• Representing sets with constant time equality testing
• On Computing the Subset Graph of a Collection of Sets

This page was built for publication: Fully dynamic algorithms for maintaining extremal sets in a family of sets^∗