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

Podrobná bibliografia

Vydané v:	Information processing letters Ročník 62; číslo 6; s. 329 - 334
Hlavný autor:	PRITCHARD, P
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Amsterdam Elsevier Science 27.06.1997 Elsevier Sequoia S.A
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!