Browse Books

Reviewer: Mukkai S. Krishnamoorthy

This book is the outcome of the Dagstuhl Conference (a prestigious European meeting) held in 2004. After two chapters about the fundamentals of network analysis, there are three major parts: elements or properties, groups or clusters, and network analysis and statistics. There are 15 chapters, which are fairly evenly divided among these three parts. Instead of references attached to each of the chapters, there is a comprehensive bibliography at the end of the book. Each chapter describes state-of-the-art research on the particular topic it covers. The chapters in the elements section deal with centrality indices, such as connectivity, shortest paths and their exact and approximate computations, and normalizations. The next section, on groups, starts with three chapters about cliques and clusters and different algorithms to compute them. Other chapters in this section deal with equivalence relations among vertices and groups of vertices, and modeling such graphs. The final section, on networks, covers network statistics, network comparison, models, spectral analysis, and robustness and resilience. The network statistics chapter deals with degree statistics, shortest distance statistics, number of shortest paths, routing costs, and clustering coefficients. In the network comparison chapter, the isomorphism of networks is explained. Different models for generating networks are described in the following chapter. Spectral properties (of the adjacency matrices of networks) and their computations are considered in the next chapter. The final chapter treats the reliability of networks. Even though each of the chapters is written by a different author, there is cohesion among them. Therefore, this edited book reads like a textbook. It will be useful to anyone interested in learning about the current state of the art of network analysis. Online Computing Reviews Service