Buch, Englisch, 144 Seiten, Format (B × H): 186 mm x 262 mm, Gewicht: 470 g
Reihe: Advances in Metaheuristics
From Games to Deterministic and Quantum Approaches
Buch, Englisch, 144 Seiten, Format (B × H): 186 mm x 262 mm, Gewicht: 470 g
Reihe: Advances in Metaheuristics
ISBN: 978-1-032-73751-5
Verlag: Taylor & Francis Ltd
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.
Zielgruppe
Academic and Postgraduate
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik Mathematik Stochastik
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Algorithmen & Datenstrukturen
- Mathematik | Informatik Mathematik Operations Research Spieltheorie
- Mathematik | Informatik EDV | Informatik Technische Informatik Quantencomputer, DNA-Computing
- Mathematik | Informatik Mathematik Mathematik Allgemein Populäre Darstellungen der Mathematik
Weitere Infos & Material
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.