Home > Tech Professional > Applied Science > GRAPHS ALGORITHMS AND OPTIMIZATION

GRAPHS ALGORITHMS AND OPTIMIZATION, 1/e

DONALD L. KREHER & WILLIAM KOCAY

 ISBN : 9781584883968 Pages : 504 Binding : Paperback Language : English Imprint : Taylor & Francis Trim size : 6" x 9" inches Weight : 1kg © year : 2013
 List Price : 550
 Offer Price : 440

20% OFF

In Stock

Credit Card / Debit Card / Internet Banking

 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. Graphs and Their Complements Paths and Walks Some Special Classes of Graphs Trees and Cycles The Structure of Trees Connectivity Alternating Paths and Matchings Network Flows Hamilton Cycles Digraphs Graph Colorings Planar Graphs Graphs and Surfaces Linear Programming The Primal-Dual Algorithm Discrete Linear Programming Provides a thorough treatment of graph theory along with data structures to show how algorithms can be programmed Includes three chapters on linear optimization, which show how linear programming is related to graph theory Emphasizes the use of programming to solve graph theory problems Presents all algorithms from a generic point of view, usable with any programming language Comprehensively handles topics such as algorithmic complexity, efficiency, and NP-completeness, topics not addressed in competitors' texts

550.00

440.00

20% OFF