NETWORK ANONYMITY METHOD FOR PERFORMING GRAPH STRUCTURE MODIFICATION BASED ON OPTIMAL GROUPING OF DEGREE SEQUENCE

摘要

A network anonymity method for performing graph structure modification based on an optimal grouping of a degree sequence, the method first converts the optimal grouping problem of a network node degree value sequence k anonymity into a shortest path problem of a directed grouped network; performing k anonymity on the network node degree value sequence according to the shortest path of the directed grouped network; modifying the network structure according to k anonymity information of the network node degree value sequence, and realizing the k anonymity operation of the network node degree value. The method can effectively reduce the amount of calculation in the network data anonymity process, and is suitable for large-scale network data anonymity processing.