Representing a concept lattice by a graph
نویسندگان
چکیده
منابع مشابه
A Graph-Theoretic Method to Representing a Concept Lattice
Concept lattices are indeed lattices. In this paper, we present a new relationship between lattices and graphs: given a binary relation I, we define an underlying graph DI , and find out the constitution in the set of cover elements of the minimum element of the concept lattice of I using the properties of DI . The following is to provide a way to establish a one-to-one correspondence between t...
متن کاملNote on Representing attribute reduction and concepts in concepts lattice using graphs
Mao H. (2017, Representing attribute reduction and concepts in concept lattice using graphs. Soft Computing 21(24):7293--7311) claims to make contributions to the study of reduction of attributes in concept lattices by using graph theory. We show that her results are either trivial or already well-known and all three algorithms proposed in the paper are incorrect.
متن کاملTotal graph of a $0$-distributive lattice
Let £ be a $0$-distributive lattice with the least element $0$, the greatest element $1$, and ${rm Z}(£)$ its set of zero-divisors. In this paper, we introduce the total graph of £, denoted by ${rm T}(G (£))$. It is the graph with all elements of £ as vertices, and for distinct $x, y in £$, the vertices $x$ and $y$ are adjacent if and only if $x vee y in {rm Z}(£)$. The basic properties of the ...
متن کاملSolving a nurse rostering problem considering nurses preferences by graph theory approach
Nurse Rostering Problem (NRP) or the Nurse Scheduling Problem (NSP) is a complex scheduling problem that affects hospital personnel on a daily basis all over the world and is known to be NP-hard.The problem is to decide which members of a team of nurses should be on duty at any time, during a rostering period of, typically, one month.It is very important to efficiently utilize time and effort, ...
متن کاملBuilding Concept Lattices by Learning Concepts from RDF Graphs Annotating Web Documents
This paper presents a method for building concept lattices by learning concepts from RDF annotations of Web documents. It consists in extracting conceptual descriptions of the Web resources from the RDF graph gathering all the resource annotations and then forming concepts from all possible subsets of resources each such subset being associated with a set of descriptions shared by the resources...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 144 شماره
صفحات -
تاریخ انتشار 2004