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 maths text is written for upper-level college students who have had previous coursework involving proofs and proof techniques. The close tie between the theoretical and algorithmic aspects of graph theory, and graphs that lend themselves naturally as models in computer science, results in a need for efficient algorithims 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.
- ISBN10 0071125752
- ISBN13 9780071125758
- Publish Date 1 March 1993 (first published 1 January 1993)
- Publish Status Out of Print
- Out of Print 19 September 2001
- Publish Country US
- Publisher McGraw-Hill Education - Europe
- Imprint McGraw-Hill Inc.,US
- Format Paperback
- Pages 384
- Language English