This preview shows page 1. Sign up to view the full content.
Unformatted text preview: requirements. Google may have returned my target page, but only on a later page. I probably would never have looked that far into the search results. 4. The clustering coefficient for a vertex is the proportion of links between the vertices within its neighborhood divided by the number of links that could possibly exist between them. In this situation, the clustering coefficient of each node would be calculated as below: Node 2: a) N(2) = {V6, V10, V15, V17, V18, V19} b) 18 Possible Edges c) 10 Connected Edges d) C = 10 / 18 Node 8: a) N(8) = {V6, V9, V12, V15, V18, V20} b) 22 Possible Edges c) 11 Connected Edges d) C = 11 / 22 Node 13: a) N(13) = {V5, V9, V11, V12, V14, V16} b) 21 Possible Edges c) 13 Connected Edges d) C = 13 / 21...
View Full
Document
 Fall '07
 HOPPE
 Algorithms

Click to edit the document details