Publisher
Springer International Publishing
Reference8 articles.
1. Albano, A., do Lago, A.P.: A convexity upper bound for the number of maximal bicliques of a bipartite graph. Discrete Applied Mathematics 165, 12–24 (2011); 10th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2011)
2. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press and McGraw-Hill Book Company (2001)
3. Duckworth, W., Manlove, D., Zito, M.: On the approximability of the maximum induced matching problem. J. Discrete Algorithms 3(1), 79–91 (2005)
4. Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Heidelberg (1999)
5. Kuznetsov, S.O.: On computing the size of a lattice and related decision problems. Order 18(4), 313–321 (2001)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献