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 Upstream Petroleum Fiscal and Valuation Modeling in Excel by Jean-Claude Fournier
Cover of the book Victorian Poetry Now by Jean-Claude Fournier
Cover of the book Subduction Dynamics by Jean-Claude Fournier
Cover of the book Active Tectonics and Seismic Potential of Alaska by Jean-Claude Fournier
Cover of the book High-Performance Managed Futures by Jean-Claude Fournier
Cover of the book Excel 2016 Power Programming with VBA by Jean-Claude Fournier
Cover of the book Knowledge Needs and Information Extraction by Jean-Claude Fournier
Cover of the book Cognitive Computing and Big Data Analytics by Jean-Claude Fournier
Cover of the book Bladder Cancer by Jean-Claude Fournier
Cover of the book Scripting Cultures by Jean-Claude Fournier
Cover of the book Security and Environmental Change by Jean-Claude Fournier
Cover of the book Photovoltaic Power System by Jean-Claude Fournier
Cover of the book Numerical Methods for Ordinary Differential Equations by Jean-Claude Fournier
Cover of the book Mobile Ad Hoc Networking by Jean-Claude Fournier
Cover of the book Rule and Rupture 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