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