Ants and graph coloring

MaRDI QIDQ4546602zbMATH OpenFDO

Authors John Shawe-Taylor, Janez Žerovnik

Publication date 20 August 2002

zbMATH Keywords

ants algorithmevolutionary search method

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Learning and adaptive systems in artificial intelligence (68T05) Nonnumerical algorithms (68W05)

Recommendations

• Ants can colour graphs
• An ant-based algorithm for coloring graphs
• An ant colony algorithm for graph coloring and labeling problems
• An ant algorithm for the sum coloring problem
• An ant algorithm for the partition graph coloring problem
• The coloring of graphs
• Graph colorings
• Colored problems in graphs
• A graph coloring problem

Cited in

(8)

• Optimization by ant algorithms: possible roles for an individual ant
• An ant-based algorithm for coloring graphs
• An improved ant colony optimisation heuristic for graph colouring
• An ant colony algorithm for graph coloring and labeling problems
• Proposing a new algorithm based on bees behavior for solving graph coloring
• Ant local search and its efficient adaptation to graph colouring
• Ants can colour graphs
• Experience-based ant coloring (EAC). A new ant-like graph-coloring algorithm

This page was built for publication: Ants and graph coloring

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