An ant-based algorithm for coloring graphs

DOI10.1016/J.DAM.2006.07.012MaRDI QIDQ2467354zbMATH OpenOpenAlexFDO

Authors Thanhvu H. Nguyen, Chirag M. Patel, Kim-Anh T. Phan, Thang Nguyen Bui

Publication date 21 January 2008

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2006.07.012

zbMATH Keywords

graph coloringant-based algorithm

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Recommendations

• scientific article; zbMATH DE number 1784918
• An ant colony algorithm for graph coloring and labeling problems
• Ant local search and its efficient adaptation to graph colouring
• Experience-based ant coloring (EAC). A new ant-like graph-coloring algorithm
• An ACO algorithm for the graph coloring problem

Cites work

• scientific article; zbMATH DE number 956839 (Why is no real title available?)
• scientific article; zbMATH DE number 956851 (Why is no real title available?)
• scientific article; zbMATH DE number 956852 (Why is no real title available?)
• A graph coloring algorithm for large scheduling problems
• A still better performance guarantee for approximate graph coloring
• An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
• Ant colony optimization: An overview
• Ants can colour graphs
• Free Bits, PCPs, and Nonapproximability---Towards Tight Results
• Genetic and hybrid algorithms for graph coloring
• Hybrid evolutionary algorithms for graph coloring
• New methods to color the vertices of a graph
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• Using tabu search techniques for graph coloring

Cited in

(22)

• An ant colony algorithm for graph coloring and labeling problems
• Patterns from nature: distributed greedy colouring with simple messages and minimal graph knowledge
• Improving the extraction and expansion method for large graph coloring
• CsegGraph: a graph colouring instance generator
• Proposing a new algorithm based on bees behavior for solving graph coloring
• Optimization by ant algorithms: possible roles for an individual ant
• An improved hybrid ant-local search algorithm for the partition graph coloring problem
• Graph coloring by multiagent fusion search
• Ant local search and its efficient adaptation to graph colouring
• Combinatorial optimization in system configuration design
• Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach
• Three new upper bounds on the chromatic number
• Online Optimization of a Color Sorting Assembly Buffer Using Ant Colony Optimization
• An ACO algorithm for the graph coloring problem
• Experience-based ant coloring (EAC). A new ant-like graph-coloring algorithm
• An ant algorithm for the partition graph coloring problem
• scientific article; zbMATH DE number 1784918 (Why is no real title available?)
• A new ant colony optimization algorithm for the lower bound of sum coloring problem
• An improved ant colony optimisation heuristic for graph colouring
• A new approach to the vertex coloring problem
• ACODYGRA: An agent algorithm for coloring dynamic graphs
• Informed reactive tabu search for graph coloring

Describes a project that uses

Uses Software

• DIMACS

This page was built for publication: An ant-based algorithm for coloring graphs

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