DOI QR코드

DOI QR Code

A METHOD FOR COMPUTING UPPER BOUNDS ON THE SIZE OF A MAXIMUM CLIQUE

Kim, Koon-Chan

  • Published : 2003.10.01

Abstract

Maximum clique problem is to find a maximum clique(largest in size) in an undirected graph G. We present a method that computes either a maximum clique or an upper bound for the size of a maximum clique in G. We show that this method performs well on certain class of graphs and discuss the application of this method in a branch and bound algorithm for solving maximum clique problem, whose efficiency is depended on the computation of good upper bounds.

Keywords

maximum clique problem;upper bound;branch and bound algorithm;clique;graph

References

  1. Algorithmica v.15 Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring E.Balas;J.Xue https://doi.org/10.1007/BF01955041
  2. Computers and Intractability: A Guide to the Theory of NP-Completeness M.R.Garey;D.S.Johnson
  3. Operations Research Letters v.9 An exact algorithm for the maximum clique problem R.Garraghan;P.M.Pardalos https://doi.org/10.1016/0167-6377(90)90057-C
  4. Operations Research Letters v.21 An algorithm for finding a maximum clique in a graph D.R.Wood https://doi.org/10.1016/S0167-6377(97)00054-0
  5. Graph Colourings Some Heuristics for Graph Coloring N.Biggs;R.Nelson(ed.);R.J.Wilson(ed.)
  6. Introduction to Graph Theory D.B.West
  7. Discrete Applied Mathematics v.120 A fast algorithm for the maximum clique problem P.R.J.Ostergard https://doi.org/10.1016/S0166-218X(01)00290-6
  8. Comput. Oper. Res. v.19 no.5 A branch and bound algorithm for the the maximum clique problem P.M.Pardalos;G.P.Rodgers https://doi.org/10.1016/0305-0548(92)90067-F
  9. Journal of Graph Theory v.2 An upper bound on the size of a largest clique in a graph D.P.Geoffroy;D.P.Sumner https://doi.org/10.1002/jgt.3190020305
  10. Journal of Graph Theory v.5 An upper bound on the size of the largest cliques in a graph A.Billionnet https://doi.org/10.1002/jgt.3190050206
  11. Journal of Global Optimization v.4 The maximum clique problem P.M.Pardalos;J.Xue https://doi.org/10.1007/BF01098364

Cited by

  1. Shielding Heterogeneous MPSoCs From Untrustworthy 3PIPs Through Security- Driven Task Scheduling vol.2, pp.4, 2014, https://doi.org/10.1109/TETC.2014.2348182