Author:
Dias Vânia M.F.,de Figueiredo Celina M.H.,Szwarcfiter Jayme L.
Subject
General Computer Science,Theoretical Computer Science
Reference19 articles.
1. G. Alexe, S. Alexe, Y. Crama, S. Foldes, P. Hammer, B. Simeone, Consensus algorithms for the generation of all maximal bicliques, Discrete Appl. Math. 145 (1) (2004) 11–21.
2. Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs;Amilhastre;Discrete Appl. Math.,1998
3. Absolute reflexive retracts and absolute bipartite retracts;Bandelt;Discrete Appl. Math.,1993
4. On bipartite and multipartite clique problems;Dawande;J. Algorithms,2001
5. Computers and Intractability, a Guide to the Theory of NP-Completeness;Garey,1979
Cited by
30 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献