Abstract
The Maximum Clique Problem (MCP) is one of the most important combinatorial optimization problems that has many practical applications such as community search in social networks. Since the MCP is known to be NP-hard, much effort has been devoted to the development of metaheuristic algorithms to find a high quality clique (solution) within reasonable running times. The Multi-start k-opt Local Search incorporating k-opt local search (MKLS) is well known as a simple and effective metaheuristic for MCP. However it takes long time to search the high-quality solution for difficult massive graphs such as real world social networks, because the search space is too large. In the case of applying metaheuristic algorithms for massive sparse graphs, adequate process such as reduction process is necessary to focus on promising search space. In this paper, we present a Multi-start k-opt Local Search with graph Reduction process (MKLS-R), for solving the maximum clique problem on massive graphs. MKLS-R is evaluated on difficult massive graphs of Network-Repository graphs. The experimental results showed that the graph reduction process in MKLS-R contributes to the improvement of the search performance of MKLS for the difficult massive graphs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
Note that the add phase of KLS in this paper randomly selects a vertex v from PA, although the original KLS [12] selects a vertex with highest degree. Therefore, calculating the degree of vertices is not performed in the addphase of KLS.
References
Network Repository. https://networkrepository.com/index.php
Battiti, R., Protasi, M.: Reactive local search for the maximum clique problem. Algorithmica 29(4), 610–637 (2001). https://doi.org/10.1007/s004530010074
Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M.: The maximum clique problem. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization (suppl. Vol. A), pp. 1–74. Kluwer (1999)
Cai, S., Lin, J., Wang, Y., Strash, D.: A semi-exact algorithm for quickly computing a maximum weight clique in large sparse graphs. J. Artif. Intell. Res. 72, 39–67 (2021)
Can, L., Xu, Y.J., Hao, W., Yikai, Z.: Finding the maximum clique in massive graphs. Proc. VLDB Endow. 10(11), 1538–1549 (2017)
Chang, L.: Efficient maximum clique computation over large sparse graphs. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 529–538 (2019)
Cheng, J., Ke, Y., Fu, A.W.C., Yu, J.X., Zhu, L.: Finding maximal cliques in massive networks by h*-graph. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, pp. 447–458 (2010)
Eppstein, D., Löffler, M., Strash, D.: Listing all maximal cliques in large sparse real-world graphs. ACM J. Exp. Algorithmics 18, 3.1-3.21 (2013)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)
Håstad, J.: Clique is hard to approximate within \(n^{1 - \epsilon }\). Acta Math. 182, 105–142 (1999)
Johnson, D.S., Trick, M.A.: Cliques, coloring, and satisfiability. In: Second DIMACS Implementation Challenge. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society (1996)
Katayama, K., Hamamoto, A., Narihisa, H.: An effective local search for the maximum clique problem. Inf. Process. Lett. 95(5), 503–511 (2005)
Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49, 291–307 (1970)
Khot, S.: Improved inapproximability results for maxclique, chromatic number and approximate graph coloring. In: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, pp. 600–609 (2001)
Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling salesman problem. Oper. Res. 21, 498–516 (1973)
Modani, N., Dey, K.: Large maximal cliques enumeration in sparse graphs. In: Proceedings of the 17th ACM Conference on Information and Knowledge Management, pp. 1377–1378 (2008)
Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: AAAI (2015)
Tomita, E.: Efficient algorithms for finding maximum and maximal cliques and their applications. In: Poon, S.-H., Rahman, M.S., Yen, H.-C. (eds.) WALCOM 2017. LNCS, vol. 10167, pp. 3–15. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-53925-6_1
Tomita, E., et al.: An improved branch-and-bound MCT algorithm for finding a maximum clique. Springer (to appear)
Wu, Q., Hao, J.-K.: A review on algorithms for maximum clique problems. Eur. J. Oper. Res. 242(3), 693–709 (2015)
Acknowledgments
This work was supported in part by JSPS KAKENHI Grant Number JP19K12166.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Kanahara, K., Oda, T., Kulla, E., Uejima, A., Katayama, K. (2022). An Efficient Local Search for the Maximum Clique Problem on Massive Graphs. In: Barolli, L., Kulla, E., Ikeda, M. (eds) Advances in Internet, Data & Web Technologies. EIDWT 2022. Lecture Notes on Data Engineering and Communications Technologies, vol 118. Springer, Cham. https://doi.org/10.1007/978-3-030-95903-6_22
Download citation
DOI: https://doi.org/10.1007/978-3-030-95903-6_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-95902-9
Online ISBN: 978-3-030-95903-6
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)