Graph Coloring

Name: Graph Coloring
Brand: Taylor & Francis
Price: 144.1 AUD
Availability: PreOrder

From Games to Deterministic and Quantum Approaches

By: Maurice Clerc

Write A Review

eText | 30 June 2025 | Edition Number 1

At a Glance

Format
ePUB

eText

$144.10

or 4 interest-free payments of $36.02 with

Available: 30th June 2025

Preorder. Online access available after release.

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.

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.