What do you think?
Rate this book
Applied and Algorithmic Graph Theory
Designed as the bridge to cross the widening gap between mathematics and computer science, and planned as the mathematical base for computer science students, this discrete math text is written for upper-level college students who have had previous course work with proofs and proof techniques.
The close tie between the theoretical and algorithmic aspects of graph theory, and the fact that graphs lend themselves naturally as models in computer science, result in a need for efficient algorithms to solve any large-scale problems. Each algorithm in the text includes explanatory statements that clarify individual steps, a worst-case complexity analysis, and algorithmic correctness proofs. As a result, the student will develop an understanding of the concept of an efficient algorithm.
The close tie between the theoretical and algorithmic aspects of graph theory, and the fact that graphs lend themselves naturally as models in computer science, result in a need for efficient algorithms to solve any large-scale problems. Each algorithm in the text includes explanatory statements that clarify individual steps, a worst-case complexity analysis, and algorithmic correctness proofs. As a result, the student will develop an understanding of the concept of an efficient algorithm.
- GenresMathematics
432 pages, Hardcover
First published July 1, 1992
6 people are currently reading
68 people want to read
About the author
Gary Chartrand
28 books11 followersGary Theodore Chartrand is a professor emeritus of mathematics at Western Michigan University
Ratings & Reviews
Friends & Following
Create a free account to discover what your friends think of this book!
Community Reviews
Displaying 1 of 1 review
May 21, 2020
A more detailed study of graphs with an emphasis on algorithms and time complexity. Not terribly well written or easy to follow. But more advanced math texts ( even less advanced ones ) rarely are.
It is thorough and comprehensive though and worth going through if you want to get up to speed on path and circuit problems. Coloring and matching problems. It gets a bit rushed and skimpy towards the end. ( Could someone please explain to me properly what Ramsey numbers are and why they are important. And I don't mean just state the somewhat tortuously complicated definition.)
You can plough through every detail if you have time - but it will take some time. Or just compile a list of known results - around the early 90s. Depends on what you need.
It is thorough and comprehensive though and worth going through if you want to get up to speed on path and circuit problems. Coloring and matching problems. It gets a bit rushed and skimpy towards the end. ( Could someone please explain to me properly what Ramsey numbers are and why they are important. And I don't mean just state the somewhat tortuously complicated definition.)
You can plough through every detail if you have time - but it will take some time. Or just compile a list of known results - around the early 90s. Depends on what you need.
Displaying 1 of 1 review