Applied and Algorithmic Graph Theory

Scanned From HardCover Version From University of Tehran Library 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. Designed as a bridge to cross the gap between mathematics and computer science, and planned as the mathematics base for computer science students, this maths text is designed to help the student develop an understanding of the concept of an efficient algorithm.