Some combinatorial characteristics of closure operations
The aim of this paper investigates some combinatorial characteristics of minimal key and antikey of closure operations. We also give effective algorithms finding minimal keys and antikeys of closure operations. We estimate these algorithms. Some remarks on the closeness of closure operations class u...
Saved in:
| Date: | 2019 |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Lugansk National Taras Shevchenko University
2019
|
| Subjects: | |
| Online Access: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/470 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Algebra and Discrete Mathematics |
Institution
Algebra and Discrete Mathematics| Summary: | The aim of this paper investigates some combinatorial characteristics of minimal key and antikey of closure operations. We also give effective algorithms finding minimal keys and antikeys of closure operations. We estimate these algorithms. Some remarks on the closeness of closure operations class under the union and direct product operations are also studied in this paper. |
|---|