Cantitate/Preț
Produs
Total produse
Vezi coșul
Graphs, Algorithms, and Optimization de William Kocay

Graphs, Algorithms, and Optimization: Discrete Mathematics and Its Applications

Autor William Kocay, Donald L. Kreher
en Limba Engleză Hardback – 26 sep 2016
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.

 
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 30762 lei  43-57 zile
  CRC Press – 21 ian 2023 30762 lei  43-57 zile
Hardback (1) 68823 lei  43-57 zile
  CRC Press – 26 sep 2016 68823 lei  43-57 zile

Din seria Discrete Mathematics and Its Applications

Preț: 68823 lei

Preț vechi: 80969 lei
-15% Nou

Puncte Express: 1032
Preț estimativ în valută:
13171€ • 13667$ • 11009£

Carte tipărită la comandă

Livrare economică 17-31 martie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781482251166
ISBN-10: 1482251167
Pagini: 566
Ilustrații: 302
Dimensiuni: 156 x 234 x 37 mm
Greutate: 0.96 kg
Ediția:Revised
Editura: CRC Press
Colecția CRC Press
Seria Discrete Mathematics and Its Applications

Locul publicării:Boca Raton, United States

Public țintă

Undergraduate

Cuprins

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

Notă biografică

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.

Recenzii

Given this is the second edition of a respected text, it is important to examine what has changed and how the text has improved. Using an “algorithmic viewpoint,” the authors explore the standard aspects of graph theory—complements, paths, walks, subgraphs, trees, cycles, connectivity, symmetry, network flows, digraphs, colorings, graph matchings, and planar graphs. The expanded topics include explorations of subgraph counting, graphs and symmetries via permutation groups, graph embeddings on topological surfaces such as the Klein bottle and the double torus, and the connections of graphs to linear programming, including the primal-dual algorithm and discrete considerations, where the integral variables are bounded. Other text changes include some proof corrections and meaningful content revisions. Each chapter section contains rich exercise sets, complemented by chapter notes and an extensive bibliography. The authors’ claim is correct—their style is "rigorous, but informal," insightful, and it works. The text’s algorithms are generic in style, and usable with any major language. In summary, aimed at computer science and mathematics students, this revised text on graph theory will both challenge upper-level undergraduates and provide a comprehensive foundation for graduate students.
--J. Johnson, Western Washington University

Descriere

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.