When you click on links to various merchants on this site and make a purchase, this can result in this site earning a commission. Affiliate programs and affiliations include, but are not limited to, the eBay Partner Network.
Basic Concepts of Graph Algorithms : Combinatorics for Computer Science, Paperback by Williamson, S. Gill, ISBN 1500276812, ISBN-13 9781500276812, Like New Used, Free shipping in the US
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.
When you click on links to various merchants on this site and make a purchase, this can result in this site earning a commission. Affiliate programs and affiliations include, but are not limited to, the eBay Partner Network.