Graph Coloring Advances in Metaheuristics
by [Clerc, Maurice]
$95.00
Description
This book explores the problem of minimal valid graph coloring, first in the form of games and then of resolution algorithms. Emphasis is placed on deterministic, guaranteed and non-guaranteed methods. Stochastic methods are then just mentioned because they are already widely described in previous publications.
The study then details a general quantum algorithm of polynomial complexity. A final chapter provides elements of reflection on diplomatic algorithms that, for the problem of coloring under resource constraints, seek a compromise minimizing frustrations. The appendix includes some mathematical additions and the source codes of the main algorithms presented, in particular the one of the quantum method.
Product Details
- CRC Press Brand
- Dec 16, 2024 Pub Date:
- 9781032737515 ISBN-13:
- 1032737514 ISBN-10:
- 144.0 pages Hardcover
- English Language
- 10 in * 7.01 in * 0.37 in Dimensions:
- 1 lb Weight:
Money Back
Love it! Use it! Reuse it!
Free Shipping
Shipping is on us
Free Support
24/24 available
