Graph Coloring
From Games to Deterministic and Quantum Approaches
Seiten
2024
CRC Press (Verlag)
978-1-032-73751-5 (ISBN)
CRC Press (Verlag)
978-1-032-73751-5 (ISBN)
This study is about the problem of minimal valid graph coloring, first in the form of games and then of resolution algorithms.
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.
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.
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.
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.
| Erscheinungsdatum | 28.11.2024 |
|---|---|
| Reihe/Serie | Advances in Metaheuristics |
| Zusatzinfo | 16 Tables, black and white; 59 Line drawings, black and white; 6 Halftones, black and white; 65 Illustrations, black and white |
| Verlagsort | London |
| Sprache | englisch |
| Maße | 178 x 254 mm |
| Gewicht | 460 g |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Mathematik / Informatik ► Mathematik ► Angewandte Mathematik | |
| Mathematik / Informatik ► Mathematik ► Finanz- / Wirtschaftsmathematik | |
| ISBN-10 | 1-032-73751-4 / 1032737514 |
| ISBN-13 | 978-1-032-73751-5 / 9781032737515 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Buch | Softcover (2025)
Lehmanns Media (Verlag)
CHF 62,95
die Welt der generativen KI verstehen
Buch | Hardcover (2025)
Hanser (Verlag)
CHF 48,95
IT zum Anfassen für alle von 9 bis 99 – vom Navi bis Social Media
Buch | Softcover (2021)
Springer (Verlag)
CHF 46,15
