Graph Algorithms 1st Edition
by S. Even /
1980 / English / PDF
3.9 MB Download
Graph theory has long become recognized as one of the more useful mathematical subjects for the computer science student to master. The approach which is natural in computer science is the algorithmic one our interest is not so much in existence proofs or enumeration techniques, as it is in finding efficient algorithms for solving relevant problems, or alternatively showing evidence that no such algorithm exists. Although algorithmic graph theory was started by Euler, if not earlier, its development in the last ten years has been dramatic and revolutionary. Much of the material of Chapters 3, 5, 6, 8, 9 and 10 is less than ten years old.
