Subject
Electrical and Electronic Engineering,Condensed Matter Physics,Radiation,Electronic, Optical and Magnetic Materials
Reference65 articles.
1. J. Abello, M. G. C. Resende, and S. Sudarsky, “Massive quasi-clique detection,” in Proc. of 5th Latin American Symp. Theoretical Informatics, LATIN, 2002, ed. by S. Rajsbaum (LNCS 2286, Springer, 2002), pp. 598–612.
2. Y. Altshuler, A. Matsliah, and A. Felner, “On the complexity of physical problems and a swarm algorithm for k-clique search in physical graphs,” in Eur. Conf. on Complex Systems (ECCS-05), 2005, (ECCS, 2005), pp. 1–27.
3. I. M. Bomze, M. Budinich, P. M. Pardalos, and M. Pelillo, “The maximum clique problem,” in Handbook of Combinatorial Optimization, ed. by D.-Z. Du and P. M. Pardalos (Springer, 1999), pp. 1–74.
4. J. M. Bourjolly, G. Laporte, and G. Pesant, “Heuristics for finding k-clubs in an undirected graph,” Comput. Oper. Res. 27, 559–569 (2000).
5. J. Brimberg, S. Janicijevic, N. Mladenovic, and D. Urosevic, “Solving the clique partitioning problem as a maximally diverse grouping problem,” Optim. Lett. 11, 1123–1135 (2015).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Capacitated Clustering Problem;Journal of Communications Technology and Electronics;2024-07-29