Exercises often ask for the efficiency (time complexity) of paths and spanning tree algorithms.
: Contains scanned or typed solutions for major chapters. Graph Theory By Narsingh Deo Exercise Solution
The difficulty spikes specifically in chapters dealing with optimization and structural properties. Exercises often ask for the efficiency (time complexity)
Perhaps the greatest value in solving Deo's exercises is the exposure to classical algorithms in their native environment. Problems revolving around the shortest path (Dijkstra’s or Warshall’s algorithms), flow problems, and traveling salesman approximations are heavily featured. Graph Theory By Narsingh Deo Exercise Solution
Creating a complete solution manual for Narsingh Deo’s Graph Theory with Applications to Engineering and Computer Science