An exact method for graph coloring
From MaRDI portal
Publication:2489282
DOI10.1016/j.cor.2005.01.008zbMath1087.05024OpenAlexW2000996459MaRDI QIDQ2489282
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
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (6)
Lower Bounds for the Minimal Sum Coloring Problem ⋮ An exact algorithm with learning for the graph coloring problem ⋮ A new ant colony optimization algorithm for the lower bound of sum coloring problem ⋮ Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts ⋮ Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach ⋮ Combinatorial optimization in system configuration design
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Using tabu search techniques for graph coloring
- An introduction to timetabling
- On a multiconstrained model for chromatic scheduling
- A decomposition algorithm for network reliability evaluation
- Hybrid evolutionary algorithms for graph coloring
- Efficient algorithms for finding critical subgraphs
- A branch-and-cut algorithm for graph coloring
- Some sequential graph colouring algorithms
- Graph minors. II. Algorithmic aspects of tree-width
- Complexity of Finding Embeddings in a k-Tree
- A Pruning Procedure for Exact Graph Coloring
- New methods to color the vertices of a graph
- A Column Generation Approach for Graph Coloring
- Finding the chromatic number by means of critical graphs
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
This page was built for publication: An exact method for graph coloring
