Basic Concepts of Graph Algorithms: Combinatorics for Computer Science - Softcover

Williamson, S. Gill

Softcover

ISBN 10: 1500276812 ISBN 13: 9781500276812

Publisher: CreateSpace Independent Publishing Platform, 2014

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.

Edition details

• Publisher: CreateSpace Independent Publishing Platform
• Publication date: 2014
• ISBN 10: 1500276812
• ISBN 13: 9781500276812
• Binding: Paperback
• Language: English
• Number of pages: 106