click to view more
Basic Concepts of Graph Algorithms Combinatorics for Computer Science
by [Williamson, S. Gill]
$10.26
Description
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.
Last updated on
Product Details
- CreateSpace Independent P Brand
- Jun 30, 2014 Pub Date:
- 9781500276812 ISBN-13:
- 1500276812 ISBN-10:
- 106.0 pages Paperback
- English Language
- 11 in * 0.24 in * 8.5 in Dimensions:
- 1 lb Weight:
Money Back
Love it! Use it! Reuse it!
Free Shipping
Shipping is on us
Free Support
24/24 available
