On the Performance of Polynomial-time CLIQUE Approximation Algorithms on Very Large Graphs
1994-001-maxclique.pdf (226.7Kb) Main Report
MetadataShow full item record
CitationHomer, Steve; Peinado, Marcus. "On the Performance of Polynomial-time CLIQUE Algorithms on Very Large Graphs”, Technical Report BUCS-1994-001, Computer Science Department, Boston University, January 1994. [Available from: http://hdl.handle.net/2144/1479]
The performance of a randomized version of the subgraph-exclusion algorithm (called Ramsey) for CLIQUE by Boppana and Halldorsson is studied on very large graphs. We compare the performance of this algorithm with the performance of two common heuristic algorithms, the greedy heuristic and a version of simulated annealing. These algorithms are tested on graphs with up to 10,000 vertices on a workstation and graphs as large as 70,000 vertices on a Connection Machine. Our implementations establish the ability to run clique approximation algorithms on very large graphs. We test our implementations on a variety of different graphs. Our conclusions indicate that on randomly generated graphs minor changes to the distribution can cause dramatic changes in the performance of the heuristic algorithms. The Ramsey algorithm, while not as good as the others for the most common distributions, seems more robust and provides a more even overall performance. In general, and especially on deterministically generated graphs, a combination of simulated annealing with either the Ramsey algorithm or the greedy heuristic seems to perform best. This combined algorithm works particularly well on large Keller and Hamming graphs and has a competitive overall performance on the DIMACS benchmark graphs.