Description: Basic Concepts of Graph Algorithms : Combinatorics for Computer Science, Paperback by Williamson, S. Gill, ISBN 1500276812, ISBN-13 9781500276812, Brand New, 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.
Price: 9.89 USD
Location: Jessup, Maryland
End Time: 2024-08-19T01:51:38.000Z
Shipping Cost: 0 USD
Product Images
Item Specifics
Return shipping will be paid by: Buyer
All returns accepted: Returns Accepted
Item must be returned within: 14 Days
Refund will be given as: Money Back
Return policy details:
Book Title: Basic Concepts of Graph Algorithms : Combinatorics for Computer S
Number of Pages: 106 Pages
Language: English
Publication Name: Basic concepts of Graph Algorithms : Combinatorics for Computer Science
Publisher: CreateSpace
Publication Year: 2014
Subject: Combinatorics
Item Height: 0.2 in
Item Weight: 11.9 Oz
Type: Textbook
Subject Area: Mathematics
Author: S. Williamson
Item Length: 11 in
Item Width: 8.5 in
Format: Trade Paperback
