KDVEM: a \(k\)-degree anonymity with vertex and edge modification algorithm

DOI10.1007/s00607-015-0453-xzbMath1329.91116OpenAlexW2083761388WikidataQ58813741 ScholiaQ58813741MaRDI QIDQ904120

Abdullah Al-Dhelaan, Yuliang Zhang, Jie Cao, Mznah Al-Rodhaan, Tinghuai Ma, Jian Shen, Yuan Tian, Mei-li Tang

Publication date: 15 January 2016

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00607-015-0453-x

zbMATH Keywords

social networks\(k\)-degree anonymity with vertex and edge modification (KDVEM)

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Graph theory (including graph drawing) in computer science (68R10)

Related Items

InfMatch: finding isomorphism subgraph on a big target graph based on the importance of vertex ⋮ CLIG: a classification method based on bidirectional layer information granularity ⋮ New publicly verifiable computation for batch matrix multiplication

Uses Software

• igraph

Cites Work

• Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
• k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
• Fast unfolding of communities in large networks