Subject
General Computer Science,Theoretical Computer Science
Reference24 articles.
1. The enumeration of maximal cliques of large graphs;Akkoyunlu;SIAM J. Comput.,1973
2. A branch and bound algorithm for the maximum clique problem;Babel;Methods Models in Oper. Res.,1990
3. A node covering algorithm;Balas;Naval Res. Log. Quart.,1977
4. Finding a maximum clique in an arbitrary graph;Balas;SIAM J. Comput.,1986
5. Algorithms for the identification of three-dimensional maximal common substructures;Brint;J. Chem. Inform. Comput. Sci.,1987
Cited by
148 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献