共 50 条
- [1] Worst-case complexity of the optimal LLL algorithm LATIN 2000: THEORETICAL INFORMATICS, 2000, 1776 : 355 - 366
- [4] An algorithm with polynomial time complexity for finding clique in a graph FIFTH INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN & COMPUTER GRAPHICS, VOLS 1 AND 2, 1997, : 500 - 505
- [6] A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2015, 17 (01): : 1 - 12
- [7] A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique WALCOM: ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2010, 5942 : 191 - 203
- [9] The worst-case time complexity for generating all maximal cliques COMPUTING AND COMBINATORICS, PROCEEDINGS, 2004, 3106 : 161 - 170