William Kocay, Donald L Kreher

Graphs, Algorithms, and Optimization

• Gebundenes Buch

Produktbeschreibung

This comprehensive text features clear exposition on modern algorithmic graph theory presented in a rigorous yet approachable way. It covers the 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.

Produktdetails

• Verlag: Taylor & Francis Ltd (Sales)
• 2nd edition
• Seitenzahl: 566
• Erscheinungstermin: 26. September 2016
• Englisch
• Abmessung: 241mm x 160mm x 36mm
• Gewicht: 953g
• ISBN-13: 9781482251166
• ISBN-10: 1482251167
• Artikelnr.: 47326692

Autorenporträt

William Kocay is a professor in the Department of Computer Science at St. Paul's College of the University of Manitoba, Canada. Donald Kreher is a professor of mathematical sciences at Michigan Technological University, Houghton, Michigan.

Inhaltsangabe

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