Basic Concepts of Graph Algorithms: Combinatorics for Computer Science by S. Gil
14,36 €
Subtitle Combinatorics for Computer Science. 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.
Jetzt bei Ebay:
