Research Article
Publishing Triangle Counting Histogram in Social Networks Based on Differential Privacy
Algorithm 1
TSER. Edge-removal projection algorithm based on edge triangle counting sorting.
Input: Original graph , threshold | Output: Truncated graph | (1) | for do | (2) | Calculate the number of triangles connected to each edge | (3) | ; / is sorted by from large to small / | (4) | ; /Edges with the number of triangles greater than the threshold / | (5) | ; /Edges whose number of triangles is less than threshold / | (6) | while max do | (7) | Edges forming triangles with | (8) | The smallest edge of in each triangle | (9) | / is sorted from small to large according to / | (10) | for do | (11) | if (−) | (12) | Remove , update , , | (13) | Traverse until all | (14) | Update the entire graph | (15) | Return |
|