|
|
|||
|
||||
OverviewThis 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 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. Full Product DetailsAuthor: Maurice ClercPublisher: Taylor & Francis Ltd Imprint: CRC Press ISBN: 9781032737515ISBN 10: 1032737514 Pages: 168 Publication Date: 16 December 2024 Audience: College/higher education , Professional and scholarly , Tertiary & Higher Education , Professional & Vocational Format: Hardback Publisher's Status: Forthcoming Availability: Not yet available This item is yet to be released. You can pre-order this item and we will dispatch it to you upon its release. Table of ContentsReviewsAuthor InformationMaurice 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 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. Tab Content 6Author Website:Countries AvailableAll regions |