An efficient branch-and-bound algorithm for finding a maximum clique

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2731, Issue , 2003, Pages 278-289

  Tomita, Etsuji ^a   Seki, Tomokazu ^a  

^a UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; BRANCH AND BOUND METHOD; DNA SEQUENCES; GRAPH THEORY; IMAGE PROCESSING; NUCLEIC ACIDS;

ARBITRARY GRAPHS; BRANCH-AND-BOUND ALGORITHMS; MAXIMUM CLIQUE; RANDOM GRAPHS; RNA SEQUENCES;

ALGORITHMS;

EID: 35248814346     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45066-1_22     Document Type: Article

References (17)

1. E. Balas and C.S. Yu: "Finding a maximum clique in an arbitrary graph," SIAM J. Comput. 15, pp.1054-1068 (1986).
2. D. Bahadur K.C., T. Akutsu, E. Tomita, T. Seki, and A. Fujiyama: "Point matching under non-uniform distortions and protein side chain packing based on efficient maximum clique algorithms," Genome Informatics 13, pp.143-152 (2002).
3. E. Balas, S. Ceria, G. Cornuéjols, and G. Pataki: "Polyhedral methods for the maximum clique problem," pp.11-28 in [9] (1996).
4. I.M. Bomze, M. Budinich, P.M. Pardalos, and M. Pelillo: "The Maximum Clique Problem." In: D.-Z. Du and P.M. Pardalos (Eds.), Handbook of Combinatorial Optimization, Supplement vol. A, Kluwer Academic Publishers, pp.1-74 (1999).
5. J.-M. Bourjolly, P. Gill, G. Laporte, and H. Mercure: "An exact quadratic 0-1 algorithm for the stable set problem," pp.53-73 in [9] (1996).
6. R. Carraghan and P.M. Pardalos: "An exact algorithm for the maximum clique problem," Oper. Res. Lett. 9, pp.375-382 (1990).
7. T. Fujii and E. Tomita: "On efficient algorithms for finding a maximum clique ," Technical Report of IECE (in Japanese), AL81-113, pp.25-34 (1982).
8. K. Hotta, E. Tomita, T. Seki, and H. Takahashi: "Object detection method based on maximum cliques," Technical Report of IPSJ (in Japanese), 2002-MPS-42, pp.49-56 (2002).
9. D. S. Johnson and M. A. Trick, (Eds.): "Cliques, Coloring, and Satisfiability," DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.26, American Mathematical Society (1996).
10. S. Kobayashi, T. Kondo, K. Okuda, and E. Tomita: "Extracting globally structure free sequences by local structure freeness," Technical Report CS 03-01, Dept. of Computer Science, Univ. of Electro-Communications (2003).
11. Y. Nakui, T. Nishino, E. Tomita, and T. Nakamura:" On the minimization of the quantum circuit depth based on a maximum clique with maximum vertex weight," Technical Report of Winter LA Symposium 2002, pp.9.1-9.7 (2003).
12. P.R.J. Östergård: "A fast algorithm for the maximum clique problem," Discrete Appl. Math. 120, pp.197-207 (2002).
13. P.M. Pardalos and J. Xue: "The maximum clique problem," J. Global Optimization 4, pp. 301-328 (1994).
14. T. Seki and E. Tomita: "Efficient branch-and-bound algorithms for finding a maximum clique," Technical Report of IEICE (in Japanese), COMP 2001-50, pp.101-108 (2001).
15. E.C. Sewell: "A branch and bound algorithm for the stability number of a sparse graph," INFORMS J. Comput. 10, pp.438-447 (1998).
16. E. Tomita, Y. Kohata, and H. Takahashi: "A simple algorithm for finding a maximum clique," Techical Report UEC-TR-C5, Dept. of Communications and Systems Engineering, Univ. of Electro communications (1988).
17. D. R. Wood: "An algorithm for finding a maximum clique in a graph," Oper. Res. Lett. 21, pp.211-217 (1997).