A graph coloring algorithm for large scheduling problems
From MaRDI portal
Publication:3878752
DOI10.6028/jres.084.024zbMath0437.68021OpenAlexW2324827308MaRDI QIDQ3878752
Publication date: 1979
Published in: Journal of Research of the National Bureau of Standards (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/128d490e1f116b410e4fd2482b54c742eb8d4371
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)
Related Items
Hybrid evolutionary search for the minimum sum coloring problem of graphs, A new oscillator coupling function for improving the solution of graph coloring problem, A graph coloring approach to the deployment scheduling and unit assignment problem, An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices, Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm, Iterative coloring extension of a maximum clique, A graph coloring algorithm for large scale scheduling problems, Coloration de graphes : fondements et applications, On the complexity of H-coloring, Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks, New secure partial encryption method for medical images using graph coloring problem, A clique covering MIP model for the irregular strip packing problem, Online algorithms for the maximum \(k\)-colorable subgraph problem, Using mixed graph coloring to minimize total completion time in job shop scheduling, Solving graph coloring problems with the Douglas-Rachford algorithm, Simple decentralized graph coloring, Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring, Gröbner bases techniques for an \(S\)-packing \(k\)-coloring of a graph, Genetic and hybrid algorithms for graph coloring, An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm, A comparison of integer programming models for the partial directed weighted improper coloring problem, Grouping products for the optimization of production processes: a case in the steel manufacturing industry, The minimum chromatic violation problem: a polyhedral approach, Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems, Supervised box clustering, Determining Sparse Jacobian Matrices Using Two-Sided Compression: An Algorithm and Lower Bounds, Partitioning \(P_4\)-tidy graphs into a stable set and a forest, Maximum-weight stable sets and safe lower bounds for graph coloring, Heuristics for a project management problem with incompatibility and assignment costs, An exact approach for the vertex coloring problem, Quantum annealing of the graph coloring 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, A graph coloring heuristic using partial solutions and a reactive tabu scheme, Heuristic for rapidly four-coloring large planar graphs, COSINE: A new graph coloring algorithm, An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem, A survey on vertex coloring problems, Complexity of stability, An ant-based algorithm for coloring graphs, Coloring graphs by iterated local search traversing feasible and infeasible solutions, Another look at graph coloring via propositional satisfiability, An improved ant colony optimisation heuristic for graph colouring, Solving vertex coloring problems as maximum weight stable set problems, Complexity of Stability., Hybrid evolutionary algorithm for the b-chromatic number, A wide-ranging computational comparison of high-performance graph colouring algorithms, Monte Carlo hyper-heuristics for examination timetabling, An effective heuristic algorithm for sum coloring of graphs, A new \textsf{DSATUR}-based algorithm for exact vertex coloring, Analytical and numerical comparisons of biogeography-based optimization and genetic algorithms, A survey of local search methods for graph coloring, A branch-and-cut algorithm for graph coloring, On the chromatic number of graphs, Improving the extraction and expansion method for large graph coloring, Solving CSPs with Naming Games, Some experiments with simulated annealing for coloring graphs, A NEW APPROACH TO THE VERTEX COLORING PROBLEM, Pattern graph for sparse Hessian matrix determination, Extended box clustering for classification problems, Multi-agent oriented constraint satisfaction, Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete, Privacy-preserving data splitting: a combinatorial approach, A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing, STABULUS: A technique for finding stable sets in large graphs with tabu search, A note on computational approaches for the antibandwidth problem, Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation, An adaptive, multiple restarts neural network algorithm for graph coloring, An introduction to timetabling, A search space ``cartography for guiding graph coloring heuristics, Estimating clique size by coloring the nodes of auxiliary graphs, On a parallel genetic-tabu search based algorithm for solving the graph colouring problem, A memetic algorithm for graph coloring, Unnamed Item, The variational quantum eigensolver: a review of methods and best practices, General vertex-distinguishing total coloring of graphs, A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results, AN EXTRACTION AND EXPANSION APPROACH FOR GRAPH COLORING, The clique-partitioning problem, An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem
