A simple sub-quadratic algorithm for computing the subset partial order

A given collection of sets has a natural partial order induced by the subset relation. Let the size N of the collection be defined as the sum of the cardinalities of the sets that comprise it. Algorithms have recently been presented that compute the partial order (and thereby the minimal and maximal...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Information processing letters Ročník 56; číslo 6; s. 337 - 341
Hlavní autor: Pritchard, Paul
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 22.12.1995
Elsevier Science
Témata:
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
Extremal sets
Lexicographic order
Mathematical logic, foundations, set theory
Mathematics
Sciences and techniques of general use
Set theory
Set-theoretic algorithms
Subset graph
Subset partial order
Theoretical computing
Set-theoretic algorithms
Extremal sets
Subset partial order
Algorithms
Lexicographic order
Subset graph
Subset relation
Partial ordering
Set theory
Algorithm complexity
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í:A given collection of sets has a natural partial order induced by the subset relation. Let the size N of the collection be defined as the sum of the cardinalities of the sets that comprise it. Algorithms have recently been presented that compute the partial order (and thereby the minimal and maximal sets, i.e., extremal sets) in worst-case time O( N 2 log N ) . This paper develops a simple algorithm that uses only simple data structures, and gives a simple analysis that establishes the above worst-case bound on its running time. The algorithm exploits a variation on lexicographic order that may be of independent interest.
ISSN:0020-0190
1872-6119
DOI:10.1016/0020-0190(95)00165-4