Advertisement

Distances, Clustering, and Small Worlds

Part of the Progress in Computer Science and Applied Logic (PCS) book series (PCS, volume 24)

Abstract

In previous chapters we have discussed distance between graphs. In this chapter we shall consider distance between vertices in a graph.

Keywords

Random Graph Complete Graph Power Grid Small World Lattice Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Birkhäuser Boston 2007

Personalised recommendations