Title: Basic Concepts of Graph Algorithms: Combinatorics for Computer Science
Publisher: Createspace Independent Publishing Platform
Publication Date: 2014
Language: English
ISBN 10: 1500276812
ISBN 13: 9781500276812
Binding: Paperback / softback
Condition: New

About this title

Synopsis

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.

"About this title" may belong to another edition of this title.

Store Description

The Saint Bookstore has a range of over 1 million titles available.

Visit Seller's Storefront

Seller's business information

SB ONLINE LTD
50 Devonshire Road, Southport, PR9 7BZ, United Kingdom

Sale & Shipping Terms

Terms of Sale

Please order through the Abebooks checkout. We only take orders through Abebooks - We don't take direct orders by email or phone.

Refunds or Returns: A full refund of the purchase price will be given if returned within 30 days in undamaged condition.

As a seller on abebooks we adhere to the terms explained at http://www.abebooks.co.uk/docs/HelpCentral/buyerIndex.shtml - if you require further assistance please email us at orders@thesaintbookstore.co.uk