Simple decentralized graph coloring

DOI10.1007/S10589-016-9862-9zbMATH Open1370.90213OpenAlexW2502162676MaRDI QIDQ2397096FDOQ2397096

Authors: Severino F. Galán 

Publication date: 29 May 2017

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-016-9862-9

Recommendations

• scientific article; zbMATH DE number 2083800
• Local optimization of colorings of graphs
• Complexity analysis of a decentralised graph colouring algorithm
• A range-compaction heuristic for graph coloring
• On graph coloring in a class of parallel local algorithms

zbMATH Keywords

graph coloring problemconflicting edges minimizationgraph coloring qualitysimple decentralized approach

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• Approximation algorithms for combinatorial problems
• A cutting plane algorithm 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
• An exact approach for the vertex coloring problem
• An upper bound for the chromatic number of a graph and its application to timetabling problems
• Title not available (Why is that?)
• What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
• On the hardness of approximating minimization problems
• Hybrid evolutionary algorithms for graph coloring
• A graph coloring heuristic using partial solutions and a reactive tabu scheme
• An improved ant colony optimisation heuristic for graph colouring
• A Column Generation Approach for Graph Coloring
• Using tabu search techniques for graph coloring
• Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
• An introduction to timetabling
• Graph coloring for air traffic flow management
• Exact solution of graph coloring problems via constraint programming and column generation
• Title not available (Why is that?)
• Variable space search for graph coloring
• A metaheuristic approach for the vertex coloring problem
• Chromatic Scheduling and the Chromatic Number Problem
• Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
• Title not available (Why is that?)
• A variable neighborhood search for graph coloring.
• Almost all k-colorable graphs are easy to color
• Genetic and hybrid algorithms for graph coloring
• Bag rationalisation for a food manufacturer
• Some experiments with simulated annealing for coloring graphs
• APPLICATION OF THE GRAPH COLORING ALGORITHM TO THE FREQUENCY ASSIGNMENT PROBLEM
• Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks
• Title not available (Why is that?)
• List-graph colouring for multiple depot vehicle scheduling
• New graph coloring algorithms

Cited In (4)

• Complexity analysis of a decentralised graph colouring algorithm
• Title not available (Why is that?)
• A range-compaction heuristic for graph coloring
• Graph coloring using peer-to-peer networks

Uses Software

• DIMACS
• NetLogo
• FrogSim
• FrogCOL

This page was built for publication: Simple decentralized graph coloring

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