Synopses & Reviews
Presents a review of graph theory, analyzing the existing links between abstract theoretical results and their practical implications using graph theoretical models and combinatorial algorithms. Includes extensive examples to illustrate the mathematical concepts when introduced. Treats subjects often excluded in other texts such as path algebra flow with grains, multicommodity flows, and the analysis and design of approximate algorithms.
Table of Contents
Generalities About Graphs.
The Shortest Path Problem in a Graph.
Path Algebras.
Trees and Arborescences.
Flows and Transportation Networks.
Flows With Gains, Multicommodity Flows.
Matchings and b-Matchings.
Eulerian and Hamiltonian Walks.
Matroids.
Non-Polynomial Problems.
Branch and Bound Algorithms.
Approximate Algorithms.
Appendixes.
Index.