Share
Basic Concepts of Graph Algorithms: Combinatorics for Computer Science
S. Gill Williamson
(Author)
·
Createspace Independent Publishing Platform
· Paperback
Basic Concepts of Graph Algorithms: Combinatorics for Computer Science - Williamson, S. Gill
Choose the list to add your product or create one New List
✓ Product added successfully to the Wishlist.
Go to My Wishlists
Origin: U.S.A.
(Import costs included in the price)
It will be shipped from our warehouse between
Friday, July 05 and
Wednesday, July 17.
You will receive it anywhere in United Kingdom between 1 and 3 business days after shipment.
Synopsis "Basic Concepts of Graph Algorithms: Combinatorics for Computer Science"
We describe and study the interplay between intuition and the precise description of graph algorithms. We learn how to use ordered rooted trees to develop and describe complex recursive algorithms. Depth first search, lineal spanning trees, chords, and backedges are used to understand complex algorithms such as those for biconnectivity and planarity. More general algoithms such as orderly algorithms are discussed in detail. We focus on the visualization of algorithms through the use of graphical and pictorial methods. This approach is both fun and powerful, preparing you to invent your own algorithms for a wide range of problems.
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
All books in our catalog are Original.
The book is written in English.
The binding of this edition is Paperback.
✓ Producto agregado correctamente al carro, Ir a Pagar.
