Description
This book provides a comprehensive and pedagogical 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 travelling 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.
About the Author
Jean-Claude Fournier is Professor at the University of Paris 12, France, and is a member of the Unite Mixte de Recherche Combinatoire et Optimisation (University of Paris 6 and CNRS) founded by Claude Berge.
Book Information
ISBN 9781848210707
Author Jean-Claude Fournier
Format Hardback
Page Count 284
Imprint ISTE Ltd and John Wiley & Sons Inc
Publisher ISTE Ltd and John Wiley & Sons Inc
Weight(grams) 549g
Dimensions(mm) 239mm * 163mm * 2mm
