Research on computing the covers of a given concept

In order to construct concept lattice without rebuilding the whole structure, we introduced some basic notions in FCA and Graph; such as concept, cover, maxmod and so on. In Section 2, we elaborated the procedures of a proposed algorithm for computing the covers by adding non-dominating maxmods to the intent of a given concept. After that we analyzed time complexity with comparison to other relevant researches and proved that our algorithm is superior to other algorithms. In the end, we discussed a few open issues.