A valuable resource for mathematics and computer science students, Graphs, Algorithms and Optimization presents the theory of graphs from an algorithmic viewpoint. The authors cover the key topics in graph theory and introduce discrete optimization and its connection to graph theory. The book contains a wealth of information on algorithms and the data structures needed to program them efficiently. Many programming techniques used for algorithms, algorithmic complexity and efficiency, a chapter on NP-completeness and three chapters on linear optimization are also included. The graph theory presented is rigorous, but the style is informal.