{ "item_title" : "Graph Coloring", "item_author" : [" Maurice Clerc "], "item_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.", "item_img_path" : "https://covers4.booksamillion.com/covers/bam/1/03/273/751/1032737514_b.jpg", "price_data" : { "retail_price" : "94.99", "online_price" : "94.99", "our_price" : "94.99", "club_price" : "94.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }

Overview

Customers Also Bought

Details