Browsing EG UK Theory and Practice of Computer Graphics 2010 by Subject "Categories and Subject Descriptors (according to ACM CCS): G.2.2 [Graph Theory]: Graph AlgorithmsI.5.3 [Clustering]: AlgorithmsF.2.2 [ Nonnumerical Algorithms and Problems]: Routing and layout"
Now showing items 1-1 of 1
-
An Evaluation of the use of Clustering Coefficient as a Heuristic for the Visualisation of Small World Graphs
(The Eurographics Association, 2010)Many graphs modelling real-world systems are characterised by a high edge density and the small world properties of a low diameter and a high clustering coefficient. In the "small world" class of graphs, the connectivity ...