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 Managing Quality by Jean-Claude Fournier
Cover of the book Economic and Business Forecasting by Jean-Claude Fournier
Cover of the book Harm to Others by Jean-Claude Fournier
Cover of the book Extraordinary Leadership in Australia and New Zealand by Jean-Claude Fournier
Cover of the book Organic Materials for Sustainable Civil Engineering by Jean-Claude Fournier
Cover of the book Managing Biotechnology by Jean-Claude Fournier
Cover of the book Questions and Answers for Dental Nurses by Jean-Claude Fournier
Cover of the book Intelligence Unbound by Jean-Claude Fournier
Cover of the book The Little Book of Bulletproof Investing by Jean-Claude Fournier
Cover of the book The Ongoing Technological System by Jean-Claude Fournier
Cover of the book Sustainable Dairy Production by Jean-Claude Fournier
Cover of the book Population and Society by Jean-Claude Fournier
Cover of the book Acoustical Imaging by Jean-Claude Fournier
Cover of the book Office 2013 Bible e-Book Library by Jean-Claude Fournier
Cover of the book Property Boom and Banking Bust 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