Graph Coloring - Clerc, Maurice; - Prospero Internet Bookshop
Basket (0)
Wishlist (0)
Your personal newsletter
__

Graph Coloring

From Games to Deterministic and Quantum Approaches
 
Edition number: 1
Publisher: CRC Press
Date of Publication:
 
Normal price:
Publisher's listprice:
GBP 68.99
Estimated price in HUF:
35 278 HUF (33 598 HUF + 5% VAT)
Why estimated?
 
Your price:
28 222 (26 878 HUF + 5% VAT )
discount is: 20% (approx 7 056 HUF off)
Discount is valid until: 31 December 2024
The discount is only available for 'Alert of Favourite Topics' newsletter recipients.
Click here to subscribe.
 
Availability:
Not yet published.
 
Add to basket
  Piece(s)

 
Short description:

This study is about the problem of minimal valid graph coloring, first in the form of games and then of resolution algorithms.

Long 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.

Table of Contents:

Preface. Chapter 1 Games. Chapter 2 A few applications. Chapter 3 Encoding. Chapter 4 Deterministic resolutions. Chapter 5 Stochastic methods. Chapter 6 A quantum method. Chapter 7 Diplomatic algorithms. Chapter 8 Appendix. Bibliography. Index.