A graph coloring algorithm for large scheduling problems

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Coloring of graphs and hypergraphs (05C15)

Cited In (85)

Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete
An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem
Coloring graphs by iterated local search traversing feasible and infeasible solutions
Exact solution of graph coloring problems via constraint programming and column generation
A NEW APPROACH TO THE VERTEX COLORING PROBLEM
Using mixed graph coloring to minimize total completion time in job shop scheduling
A graph coloring approach to the deployment scheduling and unit assignment problem
An extraction and expansion approach for graph coloring
Heuristics for a project management problem with incompatibility and assignment costs
An exact approach for the vertex coloring problem
On the complexity of H-coloring
Improving the extraction and expansion method for large graph coloring
Some experiments with simulated annealing for coloring graphs
Extended box clustering for classification problems
Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm
A search space ``cartography for guiding graph coloring heuristics
Genetic and hybrid algorithms for graph coloring
Analytical and numerical comparisons of biogeography-based optimization and genetic algorithms
Solving vertex coloring problems as maximum weight stable set problems
A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results
Heuristic for rapidly four-coloring large planar graphs
A clique covering MIP model for the irregular strip packing problem
Online algorithms for the maximum \(k\)-colorable subgraph problem
Solving graph coloring problems with the Douglas-Rachford algorithm
Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks
A new \textsf{DSATUR}-based algorithm for exact vertex coloring
Monte Carlo hyper-heuristics for examination timetabling
A survey of local search methods for graph coloring
A memetic algorithm for graph coloring
An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem
An introduction to timetabling
Multi-agent oriented constraint satisfaction
New secure partial encryption method for medical images using graph coloring problem
An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm
Quantum annealing of the graph coloring problem
A graph coloring algorithm for large scale scheduling problems
Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems
A wide-ranging computational comparison of high-performance graph colouring algorithms
COSINE: A new graph coloring algorithm
An ant-based algorithm for coloring graphs
An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices
A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing
Maximum-weight stable sets and safe lower bounds for graph coloring
On a parallel genetic-tabu search based algorithm for solving the graph colouring problem
Iterative coloring extension of a maximum clique
Supervised box clustering
Another look at graph coloring via propositional satisfiability
A branch-and-cut algorithm for graph coloring
Privacy-preserving data splitting: a combinatorial approach
On the chromatic number of graphs
STABULUS: A technique for finding stable sets in large graphs with tabu search
A survey on vertex coloring problems
A graph coloring heuristic using partial solutions and a reactive tabu scheme
An improved ant colony optimisation heuristic for graph colouring
Hybrid evolutionary search for the minimum sum coloring problem of graphs
Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
An effective heuristic algorithm for sum coloring of graphs
An adaptive, multiple restarts neural network algorithm for graph coloring
The clique-partitioning problem
An edge-swap heuristic for generating spanning trees with minimum number of branch vertices
Multi-coloring and job-scheduling with assignment and incompatibility costs
Coloration de graphes : fondements et applications
Hybrid evolutionary algorithm for the b-chromatic number
Estimating clique size by coloring the nodes of auxiliary graphs
General vertex-distinguishing total coloring of graphs
Conflict optimization for binary CSP applied to minimum partition into plane subgraphs and graph coloring
Minimum partition into plane subgraphs: the CG:SHOP challenge 2022
Adaptive and parallel multiscale framework for modeling cohesive failure in engineering scale systems
Complexity of stability
A new oscillator coupling function for improving the solution of graph coloring problem
Partitioning \(P_4\)-tidy graphs into a stable set and a forest
Determining Sparse Jacobian Matrices Using Two-Sided Compression: An Algorithm and Lower Bounds
Pattern graph for sparse Hessian matrix determination
A note on computational approaches for the antibandwidth problem
Source detection on graphs
Simple decentralized graph coloring
Gröbner bases techniques for an \(S\)-packing \(k\)-coloring of a graph
Title not available (Why is that?)
Grouping products for the optimization of production processes: a case in the steel manufacturing industry
The minimum chromatic violation problem: a polyhedral approach
Solving CSPs with Naming Games
A comparison of integer programming models for the partial directed weighted improper coloring problem
A degree reduction method for an efficient QUBO formulation for the graph coloring problem
The variational quantum eigensolver: a review of methods and best practices
Complexity of Stability.

This page was built for publication: A graph coloring algorithm for large scheduling problems

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