Simple decentralized graph coloring

DOI10.1007/S10589-016-9862-9MaRDI QIDQ2397096zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

graph coloring problemconflicting edges minimizationgraph coloring qualitysimple decentralized approach

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(5)

• A range-compaction heuristic for graph coloring
• Graph coloring using peer-to-peer networks
• Node diversification in complex networks by decentralized colouring
• Complexity analysis of a decentralised graph colouring algorithm
• scientific article; zbMATH DE number 2083800 (Why is no real title available?)

Describes a project that uses

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)