Graph Coloring

From Games to Deterministic and Quantum Approaches

Maurice Clerc

$145

Hardback

Forthcoming
Pre-Order now

QTY:

English

CRC Press
16 December 2024

Game theory; Applied mathematics; Quantum physics (quantum mechanics & quantum field theory); Algorithms & data structures

Series: Advances in Metaheuristics

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.

By: Maurice Clerc
Imprint: CRC Press
Country of Publication: United Kingdom
Dimensions: Height: 254mm, Width: 178mm,
ISBN: 9781032737515
ISBN 10: 1032737514
Series: Advances in Metaheuristics
Pages: 131
Publication Date: 16 December 2024
Audience: College/higher education , Professional and scholarly , Primary , Undergraduate
Format: Hardback
Publisher's Status: Forthcoming

Maurice Clerc is a French mathematician. He worked in the Research and Development Department of France Télécom. Retired since 2004, he remains active in various fields of research, both in particle swarm optimization (PSO)-related fields and in other areas. He regularly publishes articles, gives keynote speeches in conferences, serves as a director and thesis jury, and occasionally works as an optimization consultant.