References
- [1] J. Abello, A. J. Pogel, and L. Miller, Breadth first search graph partitions and concept lattices, J. of Universal Computer Science, 10(8), (2004), 934-954.
- [2] A. Berry, J. Bordat, and A. Sigayret, A local approach to concept generation, Annals of Mathematics and Articial Intelligence, 49(1-4), (2007), 117-136.
- [3] A. Berry and A. Sigayret, Representing a concept lattice by a graph., Dis. Appl.Math., 144, (27-42.)
- [4] G. Birkho, Lattice Theory. 3rd. ed. Providence, American Mathematical Society, 1967.
- [5] J. A. Bondy, Graph Theory with Applications, Elsevier Science Publishing Co. Inc., New York, 1976.
- [6] B. A. Davey and H. A. Priestley, Introduction to Lattices and Order, 2nd. ed. Cambridge, Cambridge University Press, 2003.
- [7] B. Ganter and R. Wille, Formal Concept Analysis, Mathematical Foundations Heidelberg, Springer-Verlag Berlin, 1999.
- [8] G. Grätzer, General Lattice Theory. 2nd. ed. Basel, Birkhäuser Verlag, 1998.
- [9] H. Mao, Concept lattices and co-covering graphs., Inter. J. of Alge., 3(3), (2009), 137-148.
- [10] S. Owais, P. Gajdoš, and V. Snášel, Usage of genetic algorithm for lattice drawing, In: CLA 2005(Eds.: R. Bělohlǎvek and V. Snášel) 82-91. ISBN 80-248-0863-3.
Language: English
Page range: 77 - 82
Published on: Nov 22, 2012
Published by: West University of Timisoara
In partnership with: Paradigm Publishing Services
Publication frequency: Volume open
Keywords:
Related subjects:
© 2012 Hua Mao, published by West University of Timisoara
This work is licensed under the Creative Commons License.