A simple and efficient branch and bound algorithm for finding a maximum clique with experimental evaluations

Systems and Computers in Japan

Volumn 28, Issue 5, 1997, Pages 60-67

  Tomita, Etsuji ^{a,d,e,f,g,h,i}   Imamatsu, Ken'Ichi ^a,b,e   Kohata, Yasuhiro ^a,c   Wakatsuki, Mitsuo ^a,j  

^a UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

^b Escom Inc

^c NTT DATA Corporation

^d TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^e University of Electro Communications ^*

^f ACM   (Japan)

^g EATCS   (Japan)

^h Waseda University   (Japan)

ⁱ Neural Network Society   (Japan)

^j IPSJ   (Japan)

more..

Author keywords

Approximate coloring; Branch and bound; Depth first search; Maximum clique

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; GRAPH THEORY; OPTIMIZATION; RANDOM PROCESSES;

APPROXIMATE COLORING ARRANGING METHOD; BRANCH AND BOUND ALGORITHMS; DEPTH FIRST SEARCH; MAXIMUM CLIQUE;

ALGORITHMS;

EID: 0031146587     PISSN: 08821666     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1520-684X(199705)28:5<60::AID-SCJ7>3.0.CO;2-M     Document Type: Article

References (10)

1. P.M. Pardalos and J. Xue. The maximum clique problem. Research Report, Dept. of Industrial and Systems Engineering, University of Florida (1992).
2. E. Tomita and T. Fujii. Efficient algorithms for finding a maximum clique and their experimental evaluation. Trans. IECE (D), J68, No. 3, pp. 221-228 (March 1985).
3. K. Imamatsu, E. Tomita, G. Ogawa, and Y. Kohata. A simple and efficient branch and bound technique for finding a maximum clique. Annual Convention IPS Japan, 6F-3 (March 1995).
4. R. Carraghan and P.M. Pardalos. An exact algorithm for the maximum clique problem. Operations Research Letters, 9, pp. 375-382 (1990).
5. L. Babel and G. Tinhofer. A branch and bound algorithm for the maximum clique problem. ZOR-Methods and Models of Operations Research, 34, pp. 207-217 (1990).
6. L. Babel. Finding maximum cliques in arbitrary and in special graphs. Computing 46, pp. 321-341 (1991).
7. E. Balas and C.S. Yu. Finding a maximum clique in an arbitrary graph. SIAM J. Comput., 15, No. 4, pp. 1054-1068 (1986).
8. C. Frieden, A. Hertz, and D. DeWerra. TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph. Computers and Operations Research, 17, No. 5, pp. 437-445 (1990).
9. C. Mannino and A. Sassano. An exact algorithm for the maximum stable set problem. Computational Optimization and Applications., 3, No. 3, pp. 243-258 (1994).
10. L. Babel. A fast algorithm for the maximum weight clique problem. Computing, 52, No. 1, pp. 31-38 (1994).