An exact method for graph coloring
DOI10.1016/J.COR.2005.01.008zbMATH Open1087.05024OpenAlexW2000996459MaRDI QIDQ2489282FDOQ2489282
Authors: Yanyan Li 
Publication date: 16 May 2006
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.01.008
Recommendations
- scientific article; zbMATH DE number 956855
- An exact graph coloring algorithm using color exchange
- An exact approach for the vertex coloring problem
- The method of coloring in graphs and its application
- A Pruning Procedure for Exact Graph Coloring
- scientific article; zbMATH DE number 1303525
- An algorithm for coloring some perfect graphs
- A polyhedral approach for graph coloring
- Graph colouring and the probabilistic method
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Complexity of Finding Embeddings in a k-Tree
- Title not available (Why is that?)
- Graph minors. II. Algorithmic aspects of tree-width
- A branch-and-cut algorithm for graph coloring
- New methods to color the vertices of a graph
- Hybrid evolutionary algorithms for graph coloring
- Efficient algorithms for finding critical subgraphs
- A Column Generation Approach for Graph Coloring
- Using tabu search techniques for graph coloring
- An introduction to timetabling
- Title not available (Why is that?)
- Finding the chromatic number by means of critical graphs
- Title not available (Why is that?)
- On a multiconstrained model for chromatic scheduling
- A Pruning Procedure for Exact Graph Coloring
- Title not available (Why is that?)
- A decomposition algorithm for network reliability evaluation
- Some sequential graph colouring algorithms
- Title not available (Why is that?)
Cited In (12)
- Exact solution of graph coloring problems via constraint programming and column generation
- Lower bounds for the minimal sum coloring problem
- 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
- Improving the extraction and expansion method for large graph coloring
- Title not available (Why is that?)
- Combinatorial optimization in system configuration design
- Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach
- An exact algorithm with learning for the graph coloring problem
- Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
- A new ant colony optimization algorithm for the lower bound of sum coloring problem
- Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles
Uses Software
This page was built for publication: An exact method for graph coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489282)
