{"product_id":"9781032737515","title":"Graph Coloring : From Games to Deterministic and Quantum Approaches by Maurice Clerc","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.\u003cbr\u003eBinding: Hardback","brand":"Gardners","offers":[{"title":"Default Title","offer_id":56312080925045,"sku":"9781032737515","price":68.99,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0612\/7193\/3106\/files\/9781032737515.jpg?v=1762820538","url":"https:\/\/backstory.london\/products\/9781032737515","provider":"Backstory","version":"1.0","type":"link"}