| Management number | 238785262 | Release Date | 2026/07/11 | List Price | $27.60 | Model Number | 238785262 | ||
|---|---|---|---|---|---|---|---|---|---|
| Category | |||||||||
<p>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.</p><p>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.</p>
| Book format | Paperback |
|---|---|
| Fiction/nonfiction | Non-Fiction |
| Genre | Computing & Internet |
| Publication date | July, 2026 |
| Pages | 144 |
| Subgenre | Programming |
| Series title | Advances in Metaheuristics |
| Number in series | 0 |
| Edition | 1 |
| Publisher | CRC Press |
| Language | English |
| Is collectible | N |
| Recording time | 0 min |
| Retail packaging | Single Piece |
| Assembled product dimensions (l x w x h) | 7.00 x 0.31 x 10.00 in |
| Assembled product weight | 0.58 lb |
| Bisac subject heading | Computers |
If you notice any omissions or errors in the product information on this page, please use the correction request form below.
Correction Request Form