Research Article
GNS: Forge High Anonymity Graph by Nonlinear Scaling Spectrum
Algorithm 2
Graph nonlinearly scaling
| Input: The adjacency matrix of matrix M | | Output: The adjacency matrix of the matrix with the same eigenvectors of M | (1) | V, = similar diagonalization (M) | (2) | = Design the scaling function () | (3) | | (4) | | (5) | Return |
|