Applied and Algorithmic Graph Theory / Edition 1 available in Hardcover
- Pub. Date:
- McGraw-Hill Higher Education
Applied and Algorithmic Graph Theory is designed to emphasize the link between the theoretical and algorithmic aspects of graph theory. Knowledge of programming languages is useful but neither essential nor assumed. Rather than employ a specific language for presenting algorithms,we use commands that are common to many languages. Each algorithm in the text includes explanatory statements that clarify the individual steps. A worst-case complexity analysis is also given for each algorithm. As a result,the student will soon develop a feel for the concept of an efficient algorithm. Proving algorithm correctness forms an integral part of the text. Whenever possible we show how algorithms can be extracted from theorems,or the students are asked to do this as an exercise. Even though the theoretical and algorithmic aspects of graph theory are stressed,the various concepts that are studied are motivated by applications. The text is aimed at upper level undergraduate students with an interest in computer science and its ties with mathematics. The authors assume that the student has some mathematical maturity and experience with proofs and proof techniques,and that the student has familiarity with basic counting techniques and the notion of the limit of a function,as well as understanding of equivalence relations.
|Publisher:||McGraw-Hill Higher Education|
|Series:||International Series in Pure and Applied Mathematics|
|Product dimensions:||6.50(w) x 1.50(h) x 9.50(d)|
Table of Contents1. An Introduction to Graphs.
2. An Introduction to Algorithms.
4. Paths and Distance and Graphs.
6. Matchings and Factorizations.
7. Eulerian Graphs.
8. Hamiltonian Graphs.
9. Planar Graphs.
10. Coloring Graphs.
12. Extremal Graph Theory.