An old sub-quadratic algorithm for finding extremal sets

Some previously proposed algorithms are re-examined. They were designed to find all sets in a collection that have no subset in the collection, but are easily modified to find all sets that have no supersets. One is shown to have a worst-case running-time of O (N-squared / log N), where N is the sum...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Information processing letters Ročník 62; číslo 6; s. 329 - 334
Hlavní autor: PRITCHARD, P
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier Science 27.06.1997
Elsevier Sequoia S.A
Témata:
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
Information processing
Mathematical analysis
Studies
Theoretical computing
Set theory
Extremal set
Algorithms
Combinatorial problem
Algorithm analysis
ISSN:0020-0190, 1872-6119
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Some previously proposed algorithms are re-examined. They were designed to find all sets in a collection that have no subset in the collection, but are easily modified to find all sets that have no supersets. One is shown to have a worst-case running-time of O (N-squared / log N), where N is the sum of the sizes of all the sets. This is lower than the only previously known sub-quadratic worst-case upper bound for this problem.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0020-0190
1872-6119
DOI:10.1016/s0020-0190(97)00084-7