Finding extremal sets in less than quadratic time

DOI10.1016/0020-0190(93)90264-AzbMath0787.68054OpenAlexW2006606301WikidataQ127673664 ScholiaQ127673664MaRDI QIDQ1313720

Daniel M. Yellin, Charanjit S. Jutla

Publication date: 24 February 1994

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

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90264-a

zbMATH Keywords

finding of extremal sets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Related Items (11)

Fully dynamic algorithms for maintaining extremal sets in a family of sets^∗ ⋮ An old sub-quadratic algorithm for finding extremal sets ⋮ On the size of the subset partial order ⋮ Positional Dominance: Concepts and Algorithms ⋮ Fast sequential and parallel algorithms for finding extremal sets ⋮ A simple sub-quadratic algorithm for computing the subset partial order ⋮ On the complexity of strongly connected components in directed hypergraphs ⋮ Computing the subset partial order for dense families of sets ⋮ Into the square: on the complexity of some quadratic-time solvable problems ⋮ Finding extremal sets in less than quadratic time ⋮ Practical Algorithms for Finding Extremal Sets

Cites Work

• Opportunistic algorithms for eliminating supersets
• New trie data structures which support very fast search operations
• Universal classes of hash functions
• Finding extremal sets in less than quadratic time
• Parallel concepts in graph theory
• Representing sets with constant time equality testing
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finding extremal sets in less than quadratic time