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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Information processing letters Jg. 62; H. 6; S. 329 - 334
1. Verfasser:	PRITCHARD, P
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier Science 27.06.1997 Elsevier Sequoia S.A
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!