Designed as the bridge to cross the widening gap between mathematics and computer science, and planned as the mathematical base for computer science students, this discrete math text is written for upper-level college students who have had previous course work with proofs and proof techniques.
The close tie between the theoretical and algorithmic aspects of graph theory, and the fact that graphs lend themselves naturally as models in computer science, result in a need for efficient algorithms to solve any large-scale problems. Each algorithm in the text includes explanatory statements that clarify individual steps, a worst-case complexity analysis, and algorithmic correctness proofs. As a result, the student will develop an understanding of the concept of an efficient algorithm.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Book by Chartrand Gary Oellermann Ortrud R
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: Philosophy, Math, and Art, Berlin, BERLI, Germania
Hardcover. Condizione: Fair. Condizione sovraccoperta: Fair. 1st Edition. Former libraray book with minimal markings, good cond. Codice articolo ABE-1788540396012
Quantità: 1 disponibili
Da: HPB-Red, Dallas, TX, U.S.A.
Hardcover. Condizione: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Codice articolo S_465997791
Quantità: 1 disponibili