Graph Coloring: From Games to Deterministic and Quantum Approaches (Advances in Metaheuristics) - Softcover
Synopsis
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.
"synopsis" may belong to another edition of this title.
About the Author
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.
"About this title" may belong to another edition of this title.
Search results for Graph Coloring: From Games to Deterministic and Quantum...
Stock Image
Graph Coloring: From Games to Deterministic and Quantum Approaches (Advances in Metaheuristics)
Seller: Majestic Books, Hounslow, United Kingdom
Seller rating 4 out of 5 stars
Condition: New. Seller Inventory # 407516142
Buy New
US$ 79.88
US$ 8.61 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 3 available
Stock Image
Graph Coloring (Paperback)
Published by
Taylor & Francis Ltd, London, 2026
ISBN 10: 1032762667
ISBN 13: 9781032762661
New
Paperback
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: 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. Seller Inventory # 9781032762661
Stock Image
Graph Coloring: From Games to Deterministic and Quantum Approaches (Advances in Metaheuristics)
Seller: Biblios, Frankfurt am main, HESSE, Germany
Seller rating 4 out of 5 stars
Condition: New. Seller Inventory # 18406686779
Buy New
US$ 97.27
US$ 11.36 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 3 available
Stock Image
Graph Coloring: From Games to Deterministic and Quantum Approaches (Advances in Metaheuristics)
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. Seller Inventory # 26406686769
Stock Image
Graph Coloring (Paperback)
Published by
Taylor & Francis Ltd, London, 2026
ISBN 10: 1032762667
ISBN 13: 9781032762661
New
Paperback
Seller: CitiRetail, Stevenage, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: 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. Seller Inventory # 9781032762661
Buy New
US$ 95.52
US$ 49.03 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available