Improving the maximum-weight clique algorithm for the dense graphs
暂无分享,去创建一个
[1] Klaus Jansen,et al. The Disjoint Cliques Problem , 1992, Universität Trier, Mathematik/Informatik, Forschungsbericht.
[2] Radu Horaud,et al. Stereo Correspondence Through Feature Grouping and Maximal Cliques , 1989, IEEE Trans. Pattern Anal. Mach. Intell..
[3] Stamatios V. Kartalopoulos,et al. Proceedings of the 12th WSEAS international conference on Computers , 2008 .
[4] O. Antoine,et al. Theory of Error-correcting Codes , 2022 .
[5] David S. Johnson,et al. Cliques, Coloring, and Satisfiability , 1996 .
[6] Panos M. Pardalos,et al. The maximum clique problem , 1994, J. Glob. Optim..
[7] K. Corrádi,et al. A combinatorial approach for Keller's conjecture , 1990 .
[8] Patric R. J. Östergård,et al. A New Algorithm for the Maximum-Weight Clique Problem , 1999, Electron. Notes Discret. Math..
[9] P Willett,et al. Use of techniques derived from graph theory to compare secondary structure motifs in proteins. , 1990, Journal of molecular biology.
[10] P. Pardalos,et al. An exact algorithm for the maximum clique problem , 1990 .