Pages that link to "Item:Q4009325"
From MaRDI portal
The following pages link to Efficient bounds on a branch and bound algorithm for graph colouration (Q4009325):
Displaying 8 items.
- Bounds and fixed-parameter algorithms for weighted improper coloring (Q737104) (← links)
- A simple branching scheme for vertex coloring problems (Q765355) (← links)
- Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs (Q897950) (← links)
- Efficient algorithms for acyclic colorings of graphs (Q1978502) (← links)
- Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams (Q2806865) (← links)
- A Wide Branching Strategy for the Graph Coloring Problem (Q2940061) (← links)
- A Game Theoretic Approach for Efficient Graph Coloring (Q3596717) (← links)
- (Q5094123) (← links)