Graphs, Algorithms, and Optimization, Second Edition

Preface; 1 Graphs and Their Complements; 2 Paths and Walks; 3 Subgraphs; 4 Some Special Classes of Graphs; 5 Trees and Cycles; 6 The Structure of Trees; 7 Connectivity; 8 Graphs and Symmetry; 9 Alternating Paths and Matchings; 10 Network Flows; 11 Hamilton Cycles; 12 Digraphs; 13 Graph Colorings; 14 Planar Graphs; 15 Graphs and Surfaces; 16 The Klein Bottle and the Double Torus; 17 Linear Programming; 18 The Primal-Dual Algorithm; 19 Discrete Linear Programming; Bibliography; Index ;A valuable resource for mathematics and computer science students, this text presents the theory of graphs from an algorithmic viewpoint. It contains a wealth of information on algorithms and the data structures needed to program them efficiently. "Graph theory offers a rich source of problems and techniques for programming and data structure development, as well as for understanding computing theory, including NP-Completeness and polynomial reduction. A comprehensive text, Graphs, Algorithms, and Optimization features clear exposition on modern algorithmic graph theory presented in a rigorous yet approachable way. The book covers major areas of graph theory including discrete optimization and its connection to graph algorithms. The authors explore surface topology from an intuitive point of view and include detailed discussions on linear programming that emphasize graph theory problems useful in mathematics and computer science. Many algorithms are provided along with the data structure needed to program the algorithms efficiently. The book also provides coverage on algorithm complexity and efficiency, NP-completeness, linear optimization, and linear programming and its relationship to graph algorithms. Written in an accessible and informal style, this work covers nearly all areas of graph theory. Graphs, Algorithms, and Optimization provides a modern discussion of graph theory applicable to mathematics, computer science, and crossover applications."--Provided by publisher A valuable resource for mathematics and computer science students, this text presents the theory of graphs from an algorithmic viewpoint. It contains a wealth of information on algorithms and the data structures needed to program them efficiently. The second edition of this popular book presents the theory of graphs from an algorithmic viewpoint. The authors present the graph theory in a rigorous, but informal style and cover most of the main areas of graph theory. The ideas of surface topology are presented from an intuitive point of view. We have also included a discussion on linear programming that emphasizes problems in graph theory. The text is suitable for students in computer science or mathematics programs

The second edition of this popular book presents the theory of graphs from an algorithmic viewpoint. The authors present the graph theory in a rigorous, but informal style and cover most of the main areas of graph theory. The ideas of surface topology are presented from an intuitive point of view. We have also included a discussion on linear programming that emphasizes problems in graph theory. The text is suitable for students in computer science or mathematics programs.

Content: Preface 1 Graphs and Their Complements 2 Paths and Walks 3 Subgraphs 4 Some Special Classes of Graphs 5 Trees and Cycles 6 The Structure of Trees 7 Connectivity 8 Graphs and Symmetry 9 Alternating Paths and Matchings 10 Network Flows 11 Hamilton Cycles 12 Digraphs 13 Graph Colorings 14 Planar Graphs 15 Graphs and Surfaces 16 The Klein Bottle and the Double Torus 17 Linear Programming 18 The Primal-Dual Algorithm 19 Discrete Linear Programming Bibliography Index