General

Authors

Search


Committee login



 
 

 


 

 

Forthcoming

Small thumbnail

Secure Connected Objects

Small thumbnail

Banach, Fréchet, Hilbert and Neumann Spaces

Analysis for PDEs Set Volume 1

Small thumbnail

Semi-Markov Migration Models for Credit Risk

Stochastic Models for Insurance Set Volume 1

Small thumbnail

Human Exposure to Electromagnetic Fields

From Extremely Low Frequency (ELF) to Radio Frequency

Small thumbnail

Enterprise Interoperability

INTEROP-PGSO Vision

Small thumbnail

Data Treatment in Environmental Sciences

Multivaried Approach

Small thumbnail

From Pinch Methodology to Pinch-Exergy Integration of Flexible Systems

Thermodynamics Energy, Environment, Economy Set

Small thumbnail

Exterior Algebras

Elementary Tribute to Grassmann's Ideas

Small thumbnail

Nonlinear Theory of Elastic Plates

Small thumbnail

Cognitive Approach to Natural Language Processing

Small thumbnail

Graph Theory and Applications

with exercises and problems

Jean-Claude Fournier, University Pierre et Marie Curie, Paris, France

ISBN: 9781848210707

Publication Date: February 2009   Hardback   288 pp.

135.00 USD


Add to cart

eBooks


Ebook Ebook

Description

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, 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.

Contents

1. Basic Concepts.
2. Trees.
3. Colorings.
4. Directed Graphs.
5. Search Algorithms.
6. Optimal Paths.
7. Matchings.
8. Flows.
9. Euler Tours.
10. Hamilton Cycles.
11. Planar Representations.
12. Problems with Comments.

About the Authors

Jean-Claude Fournier is Professor at the University of Paris 12, France, and is a member of the Unité Mixte de Recherche Combinatoire et Optimisation (University of Paris 6 and CNRS) founded by Claude Berge.

Downloads

DownloadTable of Contents - PDF File - 60 Kb

DownloadSample Chapter - PDF File - 333 Kb

Related Titles



































0.14780 s.