<P>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
Graphs, Algorithms, and Optimization, Second Edition
โ Scribed by Kocay, William; Kreher, Donald L
- Publisher
- CRC Press;Chapman and Hall/CRC
- Year
- 2017
- Tongue
- English
- Leaves
- 566
- Series
- Discrete mathematics and its applications
- Edition
- Second edition
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Synopsis
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.
ย
โฆ Table of Contents
Content: Graphs and their complements --
Paths and walks --
Subgraphs --
Some special classes of graphs --
Trees and cycles --
The structure of trees --
Connectivity --
Graphs and symmetry --
Alternating paths and matchings --
Network flows --
Hamilton cycles --
Digraphs --
Graph colorings --
Planar graphs --
Graphs and surfaces --
The Klein Bottle and Double Torus --
Linear programming --
The primal-dual algorithm --
Discrete linear programming.
โฆ Subjects
Graph algorithms.
๐ SIMILAR VOLUMES
A revised and expanded advanced-undergraduate/graduate text (first ed., 1978) about optimization algorithms for problems that can be formulated on graphs and networks. This edition provides many new applications and algorithms while maintaining the classic foundations on which contemporary algorithm
A revised and expanded advanced-undergraduate/graduate text (first ed., 1978) about optimization algorithms for problems that can be formulated on graphs and networks. This edition provides many new applications and algorithms while maintaining the classic foundations on which contemporary algorithm
A revised and expanded advanced-undergraduate/graduate text (first ed., 1978) about optimization algorithms for problems that can be formulated on graphs and networks. This edition provides many new applications and algorithms while maintaining the classic foundations on which contemporary algorithm
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 contai