Applied and Algorithmic Graph Theory - Softcover

Chartrand, Gary

Softcover

ISBN 10: 0071125752 ISBN 13: 9780071125758

Publisher: McGraw-Hill Education - Europe, 1993

Synopsis

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.

Edition details

• Publisher: McGraw-Hill Education - Europe
• Publication date: 1993
• ISBN 10: 0071125752
• ISBN 13: 9780071125758
• Binding: Paperback
• Language: English