We have described the fundamentals of sequential, parallel, and distributed graph algorithms in Part I. We then reviewed basic graph algorithms which may be used as building blocks to solve more complicated problems related to graphs in Part II which formed the core of the book. We looked at sequential, parallel, and distributed algorithmic solutions to the problems studied in this part. In the final part, we first briefly reviewed algebraic and dynamic graph algorithms. Then, our emphasis was on large graphs that represent real-life large networks commonly called complex networks. Graph algorithms for such large networks required new analysis approaches and efficient algorithms as we noted.
- 1.Banerjee S, Khuller S (2000) A clustering scheme for hierarchical routing in wireless networks. Technical report CS-TR-4103, University of Maryland, College ParkGoogle Scholar