Graph Coloring: Von Spielen zu deterministischen und Quantenansätzen (Fortschritte
79,40 €
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.
Jetzt bei Ebay:
![Produktbild - Graph Sampling [Hardback]](https://i.ebayimg.com/thumbs/images/g/TVQAAeSwx5ZoTA3S/s-l140.jpg)
![Produktbild - Advanced Graph Theory by Santosh Kumar Yadav [Paperback]](https://i.ebayimg.com/thumbs/images/g/viYAAeSwpsxoUnMK/s-l140.jpg)
![Produktbild - Deterministic and Stochastic Optimal Control and Inverse Problems [Paperback]](https://i.ebayimg.com/thumbs/images/g/3bQAAeSw3ZtoS4Hd/s-l140.jpg)
![Produktbild - Rethinking Innovation: Alternative Approaches for People and Planet [Paperback]](https://i.ebayimg.com/thumbs/images/g/-G4AAeSwG9NoTZ6J/s-l140.jpg)
