Abstract
A graph with m vertices in each of its d sections is a d-partite graph. In sections of a d-partite graph, the vertices are not connected by any edges. Each pair of vertices from different sections is always connected by an edge. If in a d-partite graph each section has m vertices, then such a graph can be divided into m d-vertex cliques if it has all edges between each pair of vertices from different sections. If in a graph with m vertices in each section there are no edges between each pair of vertices from different sections of the graph, then such a graph cannot be divided into m cliques. Such a graph can be easily divided into cliques, but their number does not have to be the maximum number of cliques into which such a graph can be divided. So this article deals with the problem of how to divide such a graph into cliques so that their number is the maximum number of cliques. For this purpose ant algorithms without and with two different dynamic desire function were used. The achieved results were compared and discussed.
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
References
Garey, M.R., Johnson, D.S.: Computer and Intractability. A Guide to the Theory of NP-Completeness. Freeman, New York (1979)
Karp, R.M.: Reducibility among Combinatorial Problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computation, pp. 85–103. Plenum Press, New York (1972)
Dorigo, M., Caro, G.D., Gambardella, L.M.: Ant algorithms for discrete optimization. Artif. Life 5(2), 137–172 (1999)
Biro, P., McDemid, E.: Three-sided stable matching with cyclic preferences. Algorithmica 58(1), 5–18 (2010)
Chen, J.: Iterative expansion and color coding: an improved algorithm for 3D-matching. ACM Trans. Algorithms 6.1_6.22 (2012)
Eriksson, K., et al.: Three-dimensional stable matching with cyclic preferences. Math. Soc. 52(1), 77–87 (2006)
Schiff, K.: An ant algorithm for the maximum number of 3-cliques in 3-partite graphs. Contr. Cybern. 347–358 (2021)
Grunert, T., Irnich, S., Zimmermann, H.J., Schneider, M., Wulfhorst, B.: Finding all k-cliques in k-partite graph, an application in textile engineering. Comput. Oper. Res. 29(2), 13–31 (2002)
Mirghorbani, M., Krokhmal, P.: On finding k-cliques in k-partite graphs. Optimiz. Lett. 7, 1155–1165 (2013)
Peters, M.: CLICK: clustering categorical data using k-partite maximal cliques. In: IEEE International Conference on Data Engineering (2005)
Liu, Q., Chen, Y.: High functional coherence in k-partite protein cliques of protein interaction networks. In: Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, pp. 111–117 (2009)
Phillips, C.A., Wang, K., Bubier, J., Baker, E.J., Chesler, E.J., Langston, M.A.: Scalable multipartite subgraph enumeration for integrative analysis of heterogeneous experimental functional genomics data. In Proceedings of the 6th ACM Conference on Bioinformatics, Computational Biology and Health Informatics, Atlanta, Georgia, 9–12 September, pp. 626–633 (2015)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Schiff, K. (2023). Ant Colony Optimization Algorithm for Finding the Maximum Number of d-Size Cliques in a Graph with Not All m Edges between Its d Parts. In: Zamojski, W., Mazurkiewicz, J., Sugier, J., Walkowiak, T., Kacprzyk, J. (eds) Dependable Computer Systems and Networks. DepCoS-RELCOMEX 2023. Lecture Notes in Networks and Systems, vol 737. Springer, Cham. https://doi.org/10.1007/978-3-031-37720-4_23
Download citation
DOI: https://doi.org/10.1007/978-3-031-37720-4_23
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-37719-8
Online ISBN: 978-3-031-37720-4
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)