1. Boros, E., Elbassioni, K.M., Gurvich, V., Khachiyan, L.: Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices. Mathematical Programming 98(1-3), 355–368 (2003)
2. North-Holland Mathematical Library;C. Berge,1989
3. Bailey, J., Manoukian, T., Ramamohanarao, K.: A fast algorithm for computing hypergraph transversals and its application in mining emerging patterns. In: ICDM 2003. Proceedings of the 3rd IEEE International Conference on Data Mining, Melbourne, Florida, USA, 19-22 December 2003, pp. 485–488. IEEE Computer Society, Los Alamitos (2003)
4. Damaschke, P.: Parameterized enumeration, transversals, and imperfect phylogeny reconstruction. Theoretical Computer Science 351(3), 337–350 (2006)
5. Dong, G., Li, J.: Mining border descriptions of emerging patterns from dataset pairs. Knowledge and Information Systems 8(2), 178–202 (2005)