|
|
 |
| |
|
|
|
Trees in Class-Oriented Concept Lattices Constrained by Equivalence Relations |
|
|
|
PP: 187-191 |
|
|
|
doi:10.18576/msl/060211
|
|
|
|
Author(s) |
|
|
|
Hua Mao,
|
|
|
|
Abstract |
|
|
| In this paper, we present necessary and sufficient conditions on input data for the output class-oriented concept lattice to form a tree after one removes its greatest element. In addition, we present algorithms for computing the tree of a class-oriented concept lattice constrained by equivalence relations. |
|
|
|
|
|
|
|
