The book has many important features which make it suitable for both undergraduate and postgraduate students in various branches of engineering and general and applied sciences. The important topics interrelating Mathematics & Computer Science are also covered briefly. The book is useful to readers
Applied and Algorithmic Graph Theory
β Scribed by Gary Chartrand, Ortrud R. Oellermann
- Publisher
- McGraw-Hill College
- Year
- 1992
- Tongue
- English
- Leaves
- 297
- Edition
- 1
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Synopsis
Scanned From HardCover Version From University of Tehran Library<\h2>
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.
π SIMILAR VOLUMES
<p>The book has many important features which make it suitable for both undergraduate and postgraduate students in various branches of engineering and general and applied sciences. The important topics interrelating Mathematics & Computer Science are also covered briefly. The book is useful to reade
<span>The book has many important features which make it suitable for both undergraduate and postgraduate students in various branches of engineering and general and applied sciences. The important topics interrelating Mathematics & Computer Science are also covered briefly. The book is useful t
<P><STRONG><EM>Graph Theory, Combinatorics and Algorithms:</EM> <EM>Interdisciplinary Applications</EM> focuses on discrete mathematics and combinatorial algorithms interacting with real world problems in computer science, operations research, applied mathematics and engineering.Β The book containsΒ
Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications focuses on discrete mathematics and combinatorial algorithms interacting with real world problems in computer science, operations research, applied mathematics and engineering.Β The book containsΒ eleven chapters written by exp