Guide to Graph Colouring: Algorithms and Applications (Texts in Computer Science)

Lewis, R. M. R.

ISBN 10: 3030810569 ISBN 13: 9783030810566
Edité par Springer, 2022
Neuf(s) Couverture souple

Vendeur Ria Christie Collections, Uxbridge, Royaume-Uni Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Vendeur AbeBooks depuis 25 mars 2015


A propos de cet article

Description :

In. N° de réf. du vendeur ria9783030810566_new

Signaler cet article

Synopsis :

This textbook treats graph colouring as an algorithmic problem, with a strong emphasis on practical applications. The author describes and analyses some of the best-known algorithms for colouring graphs, focusing on whether these heuristics can provide optimal solutions in some cases; how they perform on graphs where the chromatic number is unknown; and whether they can produce better solutions than other algorithms for certain types of graphs, and why.

 

The introductory chapters explain graph colouring, complexity theory,  bounds and constructive algorithms. The author then shows how advanced, graph colouring techniques can be applied to classic real-world operational research problems such as designing seating plans, sports scheduling, and university timetabling. He includes many examples, suggestions for further reading, and historical notes, and the book is supplemented by an online suite of downloadable code.

 

The book is of value to researchers, graduate students, and practitioners in the areas of operations research, theoretical computer science, optimization, and computational intelligence. The reader should have elementary knowledge of sets, matrices, and enumerative combinatorics.

À propos de l?auteur:

Dr. Rhyd Lewis is a reader in operational research at Cardiff School of Mathematics, Cardiff University. Previously, he was a lecturer in quantitative methods at Cardiff Business School. He holds a Ph.D. in Computer Science and Operational Research from Edinburgh Napier University. His research interests cover algorithmic graph theory and the analysis and application of metaheuristic algorithms. He is a cofounder and associate editor of the Intl. J. of Metaheuristics.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Détails bibliographiques

Titre : Guide to Graph Colouring: Algorithms and ...
Éditeur : Springer
Date d'édition : 2022
Reliure : Couverture souple
Etat : New
Edition : 2ème Édition

Meilleurs résultats de recherche sur AbeBooks

Image fournie par le vendeur

Lewis, R. M. R.
ISBN 10 : 3030810569 ISBN 13 : 9783030810566
Neuf Kartoniert / Broschiert
impression à la demande

Vendeur : moluna, Greven, Allemagne

Évaluation du vendeur 4 sur 5 étoiles Evaluation 4 étoiles, En savoir plus sur les évaluations des vendeurs

Kartoniert / Broschiert. Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This textbook treats graph colouring as an algorithmic problem, with a strong emphasis on practical applications. The author describes and analyses some of the best-known algorithms for colouring graphs, focusing on whether these heuristics can provide o. N° de réf. du vendeur 706732142

Contacter le vendeur

Acheter neuf

EUR 51,51
EUR 48,99 shipping
Expédition depuis Allemagne vers Etats-Unis

Quantité disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

R. M. R. Lewis
Edité par Springer, 2022
ISBN 10 : 3030810569 ISBN 13 : 9783030810566
Neuf Taschenbuch

Vendeur : preigu, Osnabrück, Allemagne

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Taschenbuch. Etat : Neu. Guide to Graph Colouring | Algorithms and Applications | R. M. R. Lewis | Taschenbuch | xiv | Englisch | 2022 | Springer | EAN 9783030810566 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. N° de réf. du vendeur 124663378

Contacter le vendeur

Acheter neuf

EUR 53,60
EUR 70 shipping
Expédition depuis Allemagne vers Etats-Unis

Quantité disponible : 5 disponible(s)

Ajouter au panier

Image d'archives

Lewis, R. M. R.
Edité par Springer, 2022
ISBN 10 : 3030810569 ISBN 13 : 9783030810566
Neuf Couverture souple

Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Etat : New. N° de réf. du vendeur ABLIING23Mar3113020030616

Contacter le vendeur

Acheter neuf

EUR 56,76
EUR 3,40 shipping
Expédition nationale : Etats-Unis

Quantité disponible : Plus de 20 disponibles

Ajouter au panier

Image d'archives

Lewis, R. M. R.
Edité par Springer, 2022
ISBN 10 : 3030810569 ISBN 13 : 9783030810566
Neuf Paperback
impression à la demande

Vendeur : Revaluation Books, Exeter, Royaume-Uni

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Paperback. Etat : Brand New. 2nd edition. 318 pages. 9.25x6.10x0.98 inches. In Stock. This item is printed on demand. N° de réf. du vendeur __3030810569

Contacter le vendeur

Acheter neuf

EUR 58,65
EUR 11,39 shipping
Expédition depuis Royaume-Uni vers Etats-Unis

Quantité disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

R. M. R. Lewis
ISBN 10 : 3030810569 ISBN 13 : 9783030810566
Neuf Taschenbuch

Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - This textbook treats graph colouring as an algorithmic problem, with a strong emphasis on practical applications. The author describes and analyses some of the best-known algorithms for colouring graphs, focusing on whether these heuristics can provide optimal solutions in some cases; how they perform on graphs where the chromatic number is unknown; and whether they can produce better solutions than other algorithms for certain types of graphs, and why.The introductory chapters explain graph colouring, complexity theory, bounds and constructive algorithms. The author then shows how advanced, graph colouring techniques can be applied to classic real-world operational research problems such as designing seating plans, sports scheduling, and university timetabling. He includes many examples, suggestions for further reading, and historical notes, and the book is supplemented by an online suite of downloadable code.The book is of value to researchers, graduate students, and practitioners in the areas of operations research, theoretical computer science, optimization, and computational intelligence. The reader should have elementary knowledge of sets, matrices, and enumerative combinatorics. N° de réf. du vendeur 9783030810566

Contacter le vendeur

Acheter neuf

EUR 58,84
EUR 62,44 shipping
Expédition depuis Allemagne vers Etats-Unis

Quantité disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

R. M. R. Lewis
ISBN 10 : 3030810569 ISBN 13 : 9783030810566
Neuf Taschenbuch

Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Taschenbuch. Etat : Neu. Neuware -This textbook treats graph colouring as an algorithmic problem, with a strong emphasis on practical applications. The author describes and analyses some of the best-known algorithms for colouring graphs, focusing on whether these heuristics can provide optimal solutions in some cases; how they perform on graphs where the chromatic number is unknown; and whether they can produce better solutions than other algorithms for certain types of graphs, and why.The introductory chapters explain graph colouring, complexity theory, bounds and constructive algorithms. The author then shows how advanced, graph colouring techniques can be applied to classic real-world operational research problems such as designing seating plans, sports scheduling, and university timetabling. He includes many examples, suggestions for further reading, and historical notes, and the book is supplemented by an online suite of downloadable code.The book is of value to researchers, graduate students, and practitioners in the areas of operations research, theoretical computer science, optimization, and computational intelligence. The reader should have elementary knowledge of sets, matrices, and enumerative combinatorics.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 320 pp. Englisch. N° de réf. du vendeur 9783030810566

Contacter le vendeur

Acheter neuf

EUR 58,84
EUR 60 shipping
Expédition depuis Allemagne vers Etats-Unis

Quantité disponible : 2 disponible(s)

Ajouter au panier

Image fournie par le vendeur

R. M. R. Lewis
ISBN 10 : 3030810569 ISBN 13 : 9783030810566
Neuf Taschenbuch
impression à la demande

Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This textbook treats graph colouring as an algorithmic problem, with a strong emphasis on practical applications. The author describes and analyses some of the best-known algorithms for colouring graphs, focusing on whether these heuristics can provide optimal solutions in some cases; how they perform on graphs where the chromatic number is unknown; and whether they can produce better solutions than other algorithms for certain types of graphs, and why.The introductory chapters explain graph colouring, complexity theory, bounds and constructive algorithms. The author then shows how advanced, graph colouring techniques can be applied to classic real-world operational research problems such as designing seating plans, sports scheduling, and university timetabling. He includes many examples, suggestions for further reading, and historical notes, and the book is supplemented by an online suite of downloadable code.The book is of value to researchers, graduate students, and practitioners in the areas of operations research, theoretical computer science, optimization, and computational intelligence. The reader should have elementary knowledge of sets, matrices, and enumerative combinatorics. 320 pp. Englisch. N° de réf. du vendeur 9783030810566

Contacter le vendeur

Acheter neuf

EUR 58,84
EUR 23 shipping
Expédition depuis Allemagne vers Etats-Unis

Quantité disponible : 2 disponible(s)

Ajouter au panier

Image d'archives

R.M.R. Lewis
ISBN 10 : 3030810569 ISBN 13 : 9783030810566
Neuf Paperback

Vendeur : Grand Eagle Retail, Bensenville, IL, Etats-Unis

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Paperback. Etat : new. Paperback. This textbook treats graph colouring as an algorithmic problem, with a strong emphasis on practical applications. The author describes and analyses some of the best-known algorithms for colouring graphs, focusing on whether these heuristics can provide optimal solutions in some cases; how they perform on graphs where the chromatic number is unknown; and whether they can produce better solutions than other algorithms for certain types of graphs, and why. The introductory chapters explain graph colouring, complexity theory, bounds and constructive algorithms. The author then shows how advanced, graph colouring techniques can be applied to classic real-world operational research problems such as designing seating plans, sports scheduling, and university timetabling. He includes many examples, suggestions for further reading, and historical notes, and the book is supplemented by an online suite of downloadable code. The book is of value to researchers, graduate students, and practitioners in the areas of operations research, theoretical computer science, optimization, and computational intelligence. The reader should have elementary knowledge of sets, matrices, and enumerative combinatorics. This textbook treats graph colouring as an algorithmic problem, with a strong emphasis on practical applications. and whether they can produce better solutions than other algorithms for certain types of graphs, and why. The introductory chapters explain graph colouring, complexity theory, bounds and constructive algorithms. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. N° de réf. du vendeur 9783030810566

Contacter le vendeur

Acheter neuf

EUR 60,24
Livraison gratuite
Expédition nationale : Etats-Unis

Quantité disponible : 1 disponible(s)

Ajouter au panier

Image d'archives

Lewis, R. M. R.
Edité par Springer 2022-10, 2022
ISBN 10 : 3030810569 ISBN 13 : 9783030810566
Neuf PF

Vendeur : Chiron Media, Wallingford, Royaume-Uni

Évaluation du vendeur 4 sur 5 étoiles Evaluation 4 étoiles, En savoir plus sur les évaluations des vendeurs

PF. Etat : New. N° de réf. du vendeur 6666-IUK-9783030810566

Contacter le vendeur

Acheter neuf

EUR 62,22
EUR 17,64 shipping
Expédition depuis Royaume-Uni vers Etats-Unis

Quantité disponible : 10 disponible(s)

Ajouter au panier

Image d'archives

Lewis, R. M. R.
Edité par Springer, 2022
ISBN 10 : 3030810569 ISBN 13 : 9783030810566
Neuf Couverture souple

Vendeur : California Books, Miami, FL, Etats-Unis

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Etat : New. N° de réf. du vendeur I-9783030810566

Contacter le vendeur

Acheter neuf

EUR 64,91
Livraison gratuite
Expédition nationale : Etats-Unis

Quantité disponible : Plus de 20 disponibles

Ajouter au panier

There are 5 autres exemplaires de ce livre sont disponibles

Afficher tous les résultats pour ce livre