Have a personal or library account? Click to login
An ant algorithm for the maximum number of 3-cliques in 3-partite graphs Cover

An ant algorithm for the maximum number of 3-cliques in 3-partite graphs

Control and Cybernetics
Volume 50 (2021): Issue 2 (June 2021)
By: Krzysztof Schiff  
Open Access
|Jun 2022

Authors

Krzysztof Schiff

Department of Automatic Control and Computer Science, Faculty of Electrical and Computer Engineering, Cracow University of Technology, Kraków, Poland
DOI: https://doi.org/10.2478/candc-2021-0018 | Journal eISSN: 2720-4278 | Journal ISSN: 0324-8569
Journal RSS Feed
Language: English
Page range: 347 - 358
Submitted on: Dec 1, 2020
|
Accepted on: Feb 1, 2021
|
Published on: Jun 28, 2022
Published by: Systems Research Institute Polish Academy of Sciences
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year
Keywords:
ant colony optimization,
three-partite graph,
3-clique,
combinatorial optimization,
graph theory
Related subjects:
Computer sciences,
Computer sciences, other,
Engineering,
Electrical engineering,
Fundamentals of electrical engineering,
Mechanical engineering,
Fundamentals of mechanical engineering,
Mathematics,
General mathematics

© 2022 Krzysztof Schiff, published by Systems Research Institute Polish Academy of Sciences
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Previous articleVolume 50 (2021): Issue 2 (June 2021)