Graph Coloring

Graph Coloring

Maurice Clerc

E-book

US$104.73 excl. VAT

You and your friend both get points.

Download immediately after payment, unlimited re-downloads from your account.

By starting the download you agree that your right of withdrawal ends, because the content is delivered at once.

About this title

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.

Details

Publisher
CRC Press
Language
EN
Format
EPUB
Published
ISBN
9781040256824
File protection
Watermark — opens on any reader, no extra account needed