JOURNAL BROWSE
Search
Advanced SearchSearch Tips
A METHOD FOR COMPUTING UPPER BOUNDS ON THE SIZE OF A MAXIMUM CLIQUE
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
A METHOD FOR COMPUTING UPPER BOUNDS ON THE SIZE OF A MAXIMUM CLIQUE
Kim, Koon-Chan;
  PDF(new window)
 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;
 Language
English
 Cited by
1.
Shielding Heterogeneous MPSoCs From Untrustworthy 3PIPs Through Security- Driven Task Scheduling, IEEE Transactions on Emerging Topics in Computing, 2014, 2, 4, 461  crossref(new windwow)
 References
1.
Algorithmica, 1996. vol.15. pp.397-412 crossref(new window)

2.
Graph Colourings, 1980. pp.87-96

3.
Journal of Graph Theory, 1981. vol.5. pp.165-169 crossref(new window)

4.
Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979.

5.
Operations Research Letters, 1990. vol.9. pp.375-382 crossref(new window)

6.
Journal of Graph Theory, 1978. vol.2. pp.223-230 crossref(new window)

7.
Discrete Applied Mathematics, 2002. vol.120. pp.197-207 crossref(new window)

8.
Comput. Oper. Res., 1992. vol.19. 5, pp.363-375 crossref(new window)

9.
Journal of Global Optimization, 1994. vol.4. pp.301-328 crossref(new window)

10.
Introduction to Graph Theory, 2001.

11.
Operations Research Letters, 1997. vol.21. pp.211-217 crossref(new window)