• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Basic Concepts of Graph Algorithms: Combinatorics for Computer Science

Basic Concepts of Graph Algorithms: Combinatorics for Computer Science

Paperback

General Mathematics

ISBN10: 1500276812
ISBN13: 9781500276812
Publisher: Createspace
Published: Jun 30 2014
Pages: 108
Weight: 0.59
Height: 0.22 Width: 8.50 Depth: 11.00
Language: English
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.

Also in

General Mathematics