Graph Coloring (Advances in Metaheuristics)
Clerc, Maurice
Sold by Books Puddle, New York, NY, U.S.A.
AbeBooks Seller since November 22, 2018
New - Hardcover
Condition: New
Ships within U.S.A.
Quantity: 4 available
Add to basketSold by Books Puddle, New York, NY, U.S.A.
AbeBooks Seller since November 22, 2018
Condition: New
Quantity: 4 available
Add to basketThis 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.
"About this title" may belong to another edition of this title.
We accept return for those books which are received damaged. Though we take appropriate care in packing to avoid such situation.
| Order quantity | 12 to 19 business days | 12 to 14 business days |
|---|---|---|
| First item | US$ 3.99 | US$ 6.99 |
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.