Finding graphs with exponential clique-growth using genetic algorithms

DOI10.21711/231766362023/RMC5513MaRDI QIDQ6543675zbMATH OpenFDO

Authors M. A. Pizaña, I. A. Robles

Publication date 24 May 2024

Published in Matemática Contemporânea (Search for Journal in Brave)

Full work available at URL https://doi.org/10.21711/231766362023/RMC5513

zbMATH Keywords

clique graphgenetic algorithmsgraph theory

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• A family of clique divergent graphs with linear growth
• On clique divergent graphs with linear growth
• The clique behavior of circulants with three small jumps.
• Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems
• Maximum clique exhaustive search in circulant \(k\)-hypergraphs

This page was built for publication: Finding graphs with exponential clique-growth using genetic algorithms

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