An ant-based algorithm for coloring graphs
From MaRDI portal
Publication:2467354
DOI10.1016/j.dam.2006.07.012zbMath1130.05054OpenAlexW2093373574MaRDI QIDQ2467354
Chirag M. Patel, Kim-Anh T. Phan, Thanhvu H. Nguyen, 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
Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (9)
Patterns from nature: distributed greedy colouring with simple messages and minimal graph knowledge ⋮ Improving the extraction and expansion method for large graph coloring ⋮ A NEW APPROACH TO THE VERTEX COLORING PROBLEM ⋮ Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach ⋮ CsegGraph: a graph colouring instance generator ⋮ Combinatorial optimization in system configuration design ⋮ Three new upper bounds on the chromatic number ⋮ Graph coloring by multiagent fusion search ⋮ INFORMED REACTIVE TABU SEARCH FOR GRAPH COLORING
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Using tabu search techniques for graph coloring
- A still better performance guarantee for approximate graph coloring
- Genetic and hybrid algorithms for graph coloring
- Hybrid evolutionary algorithms for graph coloring
- 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
- Ants can colour graphs
- Free Bits, PCPs, and Nonapproximability---Towards Tight Results
- An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
This page was built for publication: An ant-based algorithm for coloring graphs
