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

MaRDI QIDQ5068892zbMATH OpenFDO

Authors Krzysztof Schiff

Publication date 7 April 2022

zbMATH Keywords

ant colony optimizationcombinatorial optimization3-cliquethree-partite graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 1961993
• On finding and enumerating maximal and maximum \( k\)-partite cliques in \( k\)-partite graphs
• A study of ACO capabilities for solving the maximum clique problem
• An exact algorithm for the maximum clique problem
• On bipartite and multipartite clique problems

Cited in

(1)

• scientific article; zbMATH DE number 1961993 (Why is no real title available?)

This page was built for publication: An ant algorithm for the maximum number of 3-cliques in 3-partite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5068892)