Finding all closed sets: A general approach (Q1183948): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding all closed sets: A general approach / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 15:54, 15 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding all closed sets: A general approach |
scientific article |
Statements
Finding all closed sets: A general approach (English)
0 references
28 June 1992
0 references
We present a unifying theoretical and algorithmic approach to the problems of determining all closed sets of a closure operator, doing this up to isomorphism, and determining the elements of certain ideals of a power set. This will be done by generalizing the concept of closure operators using the interplay of several orders of a power set.
0 references
algorithms
0 references
closed sets of a closure operator
0 references
ideals of a power set
0 references
orders of a power set
0 references
