{"product_id":"graph-coloring-1","title":"Graph Coloring","description":"\u003cp\u003eThis 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.\u003c\/p\u003e\u003cp\u003eThe 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.\u003c\/p\u003e","brand":"Taylor \u0026 Francis Ltd","offers":[{"title":"Default Product","offer_id":57459846152536,"sku":"9781032762661","price":64.99,"currency_code":"EUR","in_stock":false}],"url":"https:\/\/agendabookshop.com\/products\/graph-coloring-1","provider":"Agenda Bookshop","version":"1.0","type":"link"}