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 maths text is written for upper-level college students who have had previous coursework involving proofs and proof techniques. The close tie between the theoretical and algorithmic aspects of graph theory, and graphs that lend themselves naturally as models in computer science, results in a need for efficient algorithims 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.
FREE Two-Day Shipping for Students. Learn more |
| |||||||||||||||
Book Description
Product Details
Would you like to update product info or give feedback on images?
|
More About the Author
Discover books, learn about writers, read author blogs, and more.
Customer Reviews
|
Share your thoughts with other customers:
|
||||||||||||||||||||||
|
Most Helpful Customer Reviews
5.0 out of 5 stars
Muy buen libro,
By
Amazon Verified Purchase(What's this?)
This review is from: Applied and Algorithmic Graph Theory (Hardcover)
Este libro me parece una referencia obligada para introducirse al tema de los algoritmos en gráficas. Las explicaciones son bastante claras e incluye numerosos ejercicios para practicar la teoría.
2 of 4 people found the following review helpful:
1.0 out of 5 stars
Bad, Bad Book,
By A Customer
This review is from: Applied and Algorithmic Graph Theory (Hardcover)
The book covers a lot of topics in a very short amount of space. Too few examples, and several topics given only a few sentences.Look elsewhere or get another book to supplement it.
0 of 5 people found the following review helpful:
5.0 out of 5 stars
Excellent Reference on Graph Theory and Alorithm,
By A Customer
This review is from: Applied and Algorithmic Graph Theory (Hardcover)
This book covers topics ranging from NP completeness to introductory topics on graph theory and various algorithms on SPST, MST, etc.
Share your thoughts with other customers: Create your own review
|
|
What Other Items Do Customers Buy After Viewing This Item?
Suggested Tags from Similar Products(What's this?)Be the first one to add a relevant tag (keyword that's strongly related to this product).
|
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
