An ant-based algorithm for coloring graphs
DOI10.1016/J.DAM.2006.07.012zbMATH Open1130.05054OpenAlexW2093373574MaRDI QIDQ2467354FDOQ2467354
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
Recommendations
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)
Cites Work
- Ants can colour graphs
- An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
- A graph coloring algorithm for large scheduling problems
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- New methods to color the vertices of a graph
- Hybrid evolutionary algorithms for graph coloring
- Using tabu search techniques for graph coloring
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Genetic and hybrid algorithms for graph coloring
- Free Bits, PCPs, and Nonapproximability---Towards Tight Results
- A still better performance guarantee for approximate graph coloring
- Ant colony optimization: An overview
Cited In (22)
- 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
- Experience-based ant coloring (EAC). A new ant-like graph-coloring algorithm
- An ACO algorithm for the graph coloring problem
- An ant algorithm for the partition graph coloring problem
- Title not available (Why is that?)
- 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
- An ant colony algorithm for graph coloring and labeling problems
Uses Software
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)
