[KSCI] Korea Science Citation Index Service

http://dx.doi.org/10.4134/CKMS.2003.18.4.745

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

Kim, Koon-Chan (Department of Mathematics Keimyung University)

Publication Information

Communications of the Korean Mathematical Society / v.18, no.4, 2003 , pp. 745-754 More about this Journal

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;

Citations & Related Records

Reference

1	A fast algorithm for the maximum clique problem / [ P.R.J.Ostergard ] / Discrete Applied Mathematics DOI ScienceOn
2	A branch and bound algorithm for the the maximum clique problem / [ P.M.Pardalos;G.P.Rodgers ] / Comput. Oper. Res. DOI ScienceOn
3	Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring / [ E.Balas;J.Xue ] / Algorithmica DOI
4	An exact algorithm for the maximum clique problem / [ R.Garraghan;P.M.Pardalos ] / Operations Research Letters DOI ScienceOn
5	An upper bound on the size of the largest cliques in a graph / [ A.Billionnet ] / Journal of Graph Theory DOI
6	An algorithm for finding a maximum clique in a graph / [ D.R.Wood ] / Operations Research Letters DOI ScienceOn
7	/ [ D.B.West ] / Introduction to Graph Theory
8	Some Heuristics for Graph Coloring / [ N.Biggs;R.Nelson(ed.);R.J.Wilson(ed.) ] / Graph Colourings
9	/ [ M.R.Garey;D.S.Johnson ] / Computers and Intractability: A Guide to the Theory of NP-Completeness
10	The maximum clique problem / [ P.M.Pardalos;J.Xue ] / Journal of Global Optimization DOI
11	An upper bound on the size of a largest clique in a graph / [ D.P.Geoffroy;D.P.Sumner ] / Journal of Graph Theory DOI