Graph Coloring: From Games to Deterministic and Quantum Approaches (Advances in Metaheuristics) - Tapa blanda
Sinopsis
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Acerca del autor
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Resultados de la búsqueda para Graph Coloring: From Games to Deterministic and Quantum...
Imagen de archivo
Graph Coloring: From Games to Deterministic and Quantum Approaches (Advances in Metaheuristics)
Librería: Majestic Books, Hounslow, Reino Unido
Calificación del vendedor: 4 de 5 estrellas
Condición: New. Nº de ref. del artículo: 407516142
Comprar nuevo
EUR 72,09
Envío por EUR 7,55
Se envía de Reino Unido a Estados Unidos de America
Se envía de Reino Unido a Estados Unidos de America
Cantidad disponible: 3 disponibles
Imagen de archivo
Graph Coloring (Paperback)
Publicado por
Taylor & Francis Ltd, London, 2026
ISBN 10: 1032762667
ISBN 13: 9781032762661
Nuevo
Paperback
Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: new. Paperback. 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 study is about the problem of minimal valid graph coloring, first in the form of games and then of resolution algorithms. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Nº de ref. del artículo: 9781032762661
Comprar nuevo
EUR 81,87
Gastos de envío gratis
Se envía dentro de Estados Unidos de America
Se envía dentro de Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen de archivo
Graph Coloring: From Games to Deterministic and Quantum Approaches (Advances in Metaheuristics)
Librería: Biblios, Frankfurt am main, HESSE, Alemania
Calificación del vendedor: 4 de 5 estrellas
Condición: New. Nº de ref. del artículo: 18406686779
Comprar nuevo
EUR 82,75
Envío por EUR 9,95
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 3 disponibles
Imagen de archivo
Graph Coloring: From Games to Deterministic and Quantum Approaches (Advances in Metaheuristics)
Librería: Books Puddle, New York, NY, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Condición: New. Nº de ref. del artículo: 26406686769
Comprar nuevo
EUR 95,90
Envío por EUR 3,50
Se envía dentro de Estados Unidos de America
Se envía dentro de Estados Unidos de America
Cantidad disponible: 3 disponibles
Imagen de archivo
Graph Coloring (Paperback)
Publicado por
Taylor & Francis Ltd, London, 2026
ISBN 10: 1032762667
ISBN 13: 9781032762661
Nuevo
Paperback
Librería: CitiRetail, Stevenage, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: new. Paperback. 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 study is about the problem of minimal valid graph coloring, first in the form of games and then of resolution algorithms. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Nº de ref. del artículo: 9781032762661
Comprar nuevo
EUR 83,69
Envío por EUR 42,96
Se envía de Reino Unido a Estados Unidos de America
Se envía de Reino Unido a Estados Unidos de America
Cantidad disponible: 1 disponibles