Graphs Algorithms and Optimization 1st Edition by Kocay William, Donald Kreher ISBN 1584883960 978-1584883968
Original price was: $50.00.$35.00Current price is: $35.00.
Graphs Algorithms and Optimization 1st Edition by Kocay William, Donald L. Kreher – Ebook PDF Instant Download/Delivery: 1584883960, 978-1584883968
Full download Graphs Algorithms and Optimization 1st Edition after payment
Product details:
ISBN 10: 1584883960
ISBN 13: 978-1584883968
Author: Kocay William, Donald L. Kreher
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.
Table of contents:
Chapter 1. Graphs and Their Complements
Degree Sequences
Analysis
Chapter 2. Paths and Walks
Complexity of Walks
The Shortest Path Problem
Weighted Graphs and Dijkstra’s Algorithm
Data Structures
Floyd’s Algorithm
Chapter 3. Some Special Classes of Graphs
Bipartite Graphs
Line Graphs
Moore Graphs
Euler Tours
Chapter 4. Trees and Cycles
Fundamental Co-Trees and Bonds
Spanning Tree Algorithms
Chapter 5. The Structure of Trees
Non-Rooted Trees
Read’s Tree Encoding Algorithm
Generating Rooted Trees
Generating Non-Rooted Trees
Prüfer Sequences
Spanning Trees
The Matrix-Tree Theorem
Chapter 6. Connectivity
Blocks
Finding the Blocks of a Graph
Depth-First Search
Chapter 7. Alternating Paths and Matchings
The Hungarian Algorithm
Perfect Matchings and 1-Factorizations
The Subgraph Problem
Coverings in Bipartite Graphs
Tutte’s Theorem
Chapter 8. Network Flows
Introduction
The Ford–Fulkerson Algorithm
Matchings and Flows
Menger’s Theorems
Disjoint Paths and Separating Sets
Notes
Chapter 9. Hamilton Cycles
The Crossover Algorithm
The Hamilton Closure
The Extended Multi-Path Algorithm
The Traveling Salesman Problem (TSP)
Christofides’ Algorithm
Chapter 10. Digraphs
Activity Graphs and Critical Paths
Topological Order
Strong Components
An Application to Fabrics
Tournaments
Satisfiability
Chapter 11. Graph Colorings
Cliques
Mycielski’s Construction
Critical Graphs
Chromatic Polynomials
Edge Colorings
NP-Completeness
Chapter 12. Planar Graphs
Jordan Curves
Graph Minors
Subdivisions
Euler’s Formula
Rotation Systems
Dual Graphs
Platonic Solids
Triangulations
The Sphere
Whitney’s Theorem
Medial Digraphs
The Four-Color Problem
Straight-Line Drawings
Kuratowski’s Theorem
The Hopcroft–Tarjan Algorithm
Chapter 13. Graphs and Surfaces
Surfaces
Graph Embeddings
Graphs on the Torus
Graphs on the Projective Plane
Chapter 14. Linear Programming
The Simplex Algorithm
Cycling
Chapter 15. The Primal–Dual Algorithm
Alternate Form of the Primal and Its Dual
Geometric Interpretation
Complementary Slackness
The Dual of the Shortest Path Problem
The Primal–Dual Algorithm
Chapter 16. Discrete Linear Programming
Backtracking
Branch and Bound
Unimodular Matrices
People also search for:
graph analytics algorithms
advanced graph algorithms and optimization
advanced graph algorithms and optimization eth
graphs algorithms and optimization discrete mathematics and its applications
graph optimization algorithms