swMATH3004MaRDI QIDQ15538FDOQ15538
Author name not available (Why is that?)
Official website: http://www.sciencedirect.com/science/article/pii/S0012365X00004398
Cited In (8)
- Bounding vertex coloring by truncatedmultistage branch and bound
- Title not available (Why is that?)
- An application of a new hybrid genetic algorithm to graph coloring
- Title not available (Why is that?)
- Vertex coloring of a graph for memory constrained scenarios
- Heuristic algorithms for graph set coloring problem
- gCol
- A branch-and-cut algorithm for graph coloring
This page was built for software: DSATUR
