A simple branching scheme for vertex coloring problems
From MaRDI portal
Publication:765355
DOI10.1016/J.DAM.2011.10.012zbMATH Open1237.05075OpenAlexW1999377519MaRDI QIDQ765355FDOQ765355
Federico Malucelli, Stefano Gualandi
Publication date: 19 March 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.10.012
Recommendations
- A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem
- A branch-and-cut algorithm for graph coloring
- A Wide Branching Strategy for the Graph Coloring Problem
- An exact approach for the vertex coloring problem
- A new approach to the vertex coloring problem
- Bounding vertex coloring by truncatedmultistage branch and bound
- The vertex coloring problem and its generalizations
- A survey on vertex coloring problems
- Efficient bounds on a branch and bound algorithm for graph colouration
- A branch-and-cut algorithm for partition coloring
graph coloringbranching schemeextension operatorvertex coloringgraph bandwidth coloringgraph bandwidth multicoloringgraph extension
Cites Work
- A survey on vertex coloring problems
- A Column Generation Approach for Graph Coloring
- Title not available (Why is that?)
- Exact solution of graph coloring problems via constraint programming and column generation
- Models and solution techniques for frequency assignment problems
- Frequency assignment in mobile radio systems using branch-and-cut techniques
- A column generation and branch-and-cut algorithm for the channel assignment problem
- Determining the Chromatic Number of a Graph
- A Branch-And-Price Approach for Graph Multi-Coloring
- An Algorithm for Determining the Chromatic Number of a Graph
Cited In (7)
- Exact solution of graph coloring problems via constraint programming and column generation
- A Wide Branching Strategy for the Graph Coloring Problem
- Exploring the role of graph spectra in graph coloring algorithm performance
- Total coloring and total matching: polyhedra and facets
- Maximum-weight stable sets and safe lower bounds for graph coloring
- Constraint programming-based column generation
- A branch-and-price algorithm for the minimum sum coloring problem
Uses Software
This page was built for publication: A simple branching scheme for vertex coloring problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765355)
