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.

Product Description

Book by Chartrand Gary Oellermann Ortrud R

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Descrizione libreria

We offer a wide variety of books including fiction and non-fiction titles.

Visita la pagina della libreria

Informazioni sull?azienda del venditore

SBYB, Inc.
900 Knell Rd, Montgomery, IL, 60538, U.S.A.

Condizioni di vendita e spedizione

Condizioni di vendita

We guarantee the condition of every book as it's described on the Abebooks web sites. If you're dissatisfied with your purchase (Incorrect Book/Not as Described/Damaged) or if the order hasn't arrived, you're eligible for a refund within 30 days of the estimated delivery date. If you've changed your mind about a book that you've ordered, please use the Ask bookseller a question link to contact us and we'll respond within 2 business days.

Condizioni di spedizione

Shipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required.