Distances, Clustering, and Small Worlds
Part of the Progress in Computer Science and Applied Logic (PCS) book series (PCS, volume 24)
In previous chapters we have discussed distance between graphs. In this chapter we shall consider distance between vertices in a graph.
KeywordsRandom 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.
Unable to display preview. Download preview PDF.
© Birkhäuser Boston 2007