Graph Coloring
From Games to Deterministic and Quantum Approaches
1st Edition
Published on 11. June 2025
144 pages
978-1-040-25678-7 (ISBN)
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.
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.
More details
Series
Edition
1. Auflage
Language
English
Place of publication
London
United Kingdom
Publishing group
Taylor & Francis Ltd
Target group
College/higher education
Professional and scholarly
Illustrations
16 Tables, black and white; 59 Line drawings, black and white; 6 Halftones, black and white; 65 Illustrations, black and white
File size
44,41 MB
ISBN-13
978-1-040-25678-7 (9781040256787)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions
Book
approx. 07/2026
1st Edition
CRC Press
€65.00
Not yet published
Book
12/2024
1st Edition
CRC Press
€109.30
Shipment within 10-20 days
Person
Maurice Clerc is a French mathematician. He worked in the Research and Development Department of France Telecom. 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.
Content
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.
