Graphs Theory and Applications

With Exercises and Problems

Nonfiction, Science & Nature, Mathematics
Cover of the book Graphs Theory and Applications by Jean-Claude Fournier, Wiley
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Jean-Claude Fournier ISBN: 9781118623091
Publisher: Wiley Publication: May 6, 2013
Imprint: Wiley-ISTE Language: English
Author: Jean-Claude Fournier
ISBN: 9781118623091
Publisher: Wiley
Publication: May 6, 2013
Imprint: Wiley-ISTE
Language: English

This book provides a pedagogical and comprehensive introduction to graph theory and its applications. It contains all the standard basic material and develops significant topics and applications, such as: colorings and the timetabling problem, matchings and the optimal assignment problem, and Hamiltonian cycles and the traveling salesman problem, to name but a few. Exercises at various levels are given at the end of each chapter, and a final chapter presents a few general problems with hints for solutions, thus providing the reader with the opportunity to test and refine their knowledge on the subject. An appendix outlines the basis of computational complexity theory, in particular the definition of NP-completeness, which is essential for algorithmic applications.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

This book provides a pedagogical and comprehensive introduction to graph theory and its applications. It contains all the standard basic material and develops significant topics and applications, such as: colorings and the timetabling problem, matchings and the optimal assignment problem, and Hamiltonian cycles and the traveling salesman problem, to name but a few. Exercises at various levels are given at the end of each chapter, and a final chapter presents a few general problems with hints for solutions, thus providing the reader with the opportunity to test and refine their knowledge on the subject. An appendix outlines the basis of computational complexity theory, in particular the definition of NP-completeness, which is essential for algorithmic applications.

More books from Wiley

Cover of the book Performance Coaching For Dummies by Jean-Claude Fournier
Cover of the book Digital Design of Signal Processing Systems by Jean-Claude Fournier
Cover of the book Autodesk 3ds Max 2014 Bible by Jean-Claude Fournier
Cover of the book Environmental Process Analysis by Jean-Claude Fournier
Cover of the book Biomass Energy with Carbon Capture and Storage (BECCS) by Jean-Claude Fournier
Cover of the book Should We Colonize Other Planets? by Jean-Claude Fournier
Cover of the book Singer and Monaghan's Cervical and Lower Genital Tract Precancer by Jean-Claude Fournier
Cover of the book Wall Street at War by Jean-Claude Fournier
Cover of the book Suggestibility in Legal Contexts by Jean-Claude Fournier
Cover of the book Education Nation by Jean-Claude Fournier
Cover of the book Top Hedge Fund Investors by Jean-Claude Fournier
Cover of the book Remote Sensing of the Cryosphere by Jean-Claude Fournier
Cover of the book Professional SQL Server 2008 Internals and Troubleshooting by Jean-Claude Fournier
Cover of the book The Handbook of Advanced Proficiency in Second Language Acquisition by Jean-Claude Fournier
Cover of the book Office 2019 For Dummies by Jean-Claude Fournier
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy