Tasuta kohaletoimetamine tellimustele üle 29 €
  • check 10+ miljonit raamatut
  • check Uued tooted iga päev
  • check Meid usaldab üle 1 miljoni kliendi
  • check Hea hind ja allahindlused
  • check Tarne üle kogu Euroopa

Basic Concepts of Graph Algorithms Combinatorics for Computer Science - S. Williamson

inglise keel
2014-06-30
5,40 € 9,00 €

-40% koodiga BOOKS

Meie tarnija laos

Saadetis 10-16 tööpäeva jooksul

30-päevane tagastamisõigus

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 dis ... Täielik kirjeldus

Võib-olla meeldib sulle ka

Kirjeldus

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.

Lisateave

Autor S. Williamson
Kirjastaja CreateSpace Independent Publishing Platform
Väljalaskeaasta 2014
Kaanetüüp Pehme kaanega
EAN 9781500276812
Kirjuta oma arvustus
Te vaatate: Basic Concepts of Graph Algorithms Combinatorics for Computer Science
Teie hinnang:

Goodreads'i arvustused

5,40 € 9,00 €