An algorithm for finding a maximum clique in a graph

Operations Research Letters

Volumn 21, Issue 5, 1997, Pages 211-217

  Wood, David R ^a  

^a MONASH UNIVERSITY   (Australia)

Author keywords

Branch and bound algorithm; Fractional coloring; Graph algorithm; Maximum clique problem; Vertex coloring

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; COMPUTATIONAL METHODS; GRAPH THEORY; HEURISTIC METHODS;

BRANCH AND BOUND ALGORITHM; FRACTIONAL COLORING; GRAPH ALGORITHM; MAXIMUM CLIQUE PROBLEMS; VERTEX COLORING;

OPERATIONS RESEARCH;

EID: 0031379277     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(97)00054-0     Document Type: Article

References (19)

1. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification and intractability of approximation problems, Proc. 33rd IEEE Symp. on Foundations of Computer Science, 1992, pp. 13-22.
2. L. Babel, Finding maximum cliques in arbitrary and in special graphs, computing 46 (1991) 321-341.
3. L. Babel, G. Tinhofer, A branch and bound algorithm for the maximum clique problem, Meth. Oper. Res. 34 (1990) 207-217.
4. E. Balas, A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring, Discrete Appl. Math. 15 (1986) 123-134.
5. E. Balas, J. Xue, Minimum weighted coloring of triangulated graphs, with application to maximum weight vertex packing and clique finding in arbitrary graphs, SIAM J. Comput. 20(2) (1991) 209-221.
6. E. Balas, J. Xue, Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring, Algorithmica 15 (1996) 397-412.
7. E. Balas, C.S. Yu, Finding a maximum clique in an arbitrary graph, SIAM J. Comput. 15(4) (1986) 1054-1068.
8. N. Biggs, Some Heuristics for Graph Coloring, in: R. Nelson, R.J. Wilson, (Eds.), Graph Colourings, Longman, New York, 1990, pp. 87-96.
9. D. Brelaz, New methods to color the vertices of a graph, Comm. ACM 22 (1979) 251-256.
10. C. Bron, J. Kerbosch, Finding all cliques of an undirected graph, Comm. ACM 16(9) (1973) 575-577.
11. R. Garraghan, P.M. Pardalos, An exact algorithm for the maximum clique problem, Oper. Res. Lett. 9 (1990) 375-382.
12. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
13. M. Grötschel, L. Lovász, A. Schrijver, Polynomial algorithms for perfect graphs, Ann. Discrete Math. 21 (1984) 325-356.
14. D.S. Johnson, M.A. Trick (Eds.), Cliques, Coloring, and Satisfiability: Second DIMACS Challenge. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, Providence, 1996.
15. P.M. Pardalos, G.P. Rodgers, A branch and bound algorithm for the maximum clique problem, Comput. Oper. Res. 19(5) (1992) 363-375.
16. P.M. Pardalos, J. Xue, The maximum clique problem. J. Global Optim. 4 (1994) 301-328.
17. M. Schönert et al., GAP-Groups, Algorithms and Programming, Lehrstuhl D für Mathematik, Rheinisch Westfälische Technische Hochschule, Aachen, Germany, 1995.
18. R.E. Tarjan, A.E. Trojanowski, Finding a maximum independent set, SIAM J. Comput. 6(3) (1977) 537-546.
19. D.R. Wood, An algorithm for finding a maximum clique in a graph, Technical Report 96/260, Department of Computer Science, Monash University, Australia, 1996, available at ftp.cs.monash.edu.au.