《Table 1 The adjacency matrix of C3》

  提示：宽带有限、当前游客访问压缩模式

本系列图表出处文件名：随高清版一同展现

《Graph publishing method based on differential privacy protection》

1. 获取 高清版本忘记账户？点击这里登录

1. 下载图表忘记账户？点击这里登录

Example 2 Considers the subgraph C3={4，5，6，7，8，9，10，11}of the graph in Fig.1 and its adjacency matrix in Table 1.Suppose the height of quad-tree is calculated to 2.The first possible parting result is R1=[4:7，4:7]，R2=[4:7，8:11]，R3=[8:11，4:7]，R4=[8:11，8:11].According to the noisy count，CGM model needs to further partition R2.After that，the corresponding quad-tree is illustrated in Fig.2.