Abstract
Computing the maximal bicliques of a bipartite graph is equivalent to generating the concepts of the binary relation defined by the matrix of this graph. We study this problem for special classes of input relations for which concepts can be generated much more efficiently than in the general case; in some special cases, we can even say that the number of concepts is polynornially bounded, and all concepts can be generated particularly quickly. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Berry, A., McConnell, R. M., Sigayret, A., & Spinrad, J. P. (2006). Very fast instances for concept generation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3874 LNAI, pp. 119–129). Springer Verlag. https://doi.org/10.1007/11671404_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
