On maximum clique problems in very large graphs

We present an approach for clique and quasi-clique computations in very large multi-digraphs. We discuss graph decomposition schemes used to break up the problem into several pieces of manageable dimensions. A semiexternal greedy randomized adaptive search procedure (GRASP) for finding approximate solutions to the maximum clique problem and maximum quasiclique problem in very large sparse graphs is presented. We experiment with this heuristic on real data sets collected in the telecommunications industry. These graphs contain on the order of millions of vertices and edges.

[1]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[2]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[3]  Editors , 1986, Brain Research Bulletin.

[4]  M. Resende,et al.  A probabilistic heuristic for a computationally difficult set covering problem , 1989 .

[5]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[6]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

[7]  Mihalis Yannakakis,et al.  On the approximation of maximum satisfiability , 1992, SODA '92.

[8]  Piotr Berman,et al.  On the Complexity of Approximating the Independent Set Problem , 1989, Inf. Comput..

[9]  Panos M. Pardalos,et al.  Test case generators and computational results for the maximum clique problem , 1993, J. Glob. Optim..

[10]  Panos M. Pardalos,et al.  The maximum clique problem , 1994, J. Glob. Optim..

[11]  Mauricio G. C. Resende,et al.  A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set , 1994, Oper. Res..

[12]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[13]  R. Tarjan,et al.  Fortran Subroutines for Approximate Solution of Maximum Independent Set Problems Using Grasp , 1997 .

[14]  Mauricio G. C. Resende,et al.  Algorithm 787: Fortran subroutines for approximate solution of maximum independent set problems using GRASP , 1998, TOMS.

[15]  Manuel Laguna,et al.  Tabu Search , 1997 .