scholarly journals Extend, don’t rebuild: Phrasing conditional graph modification as autoregressive sequence labelling

2021 ◽  
Author(s):  
Leon Weber ◽  
Jannes Münchmeyer ◽  
Samuele Garda ◽  
Ulf Leser
Keyword(s):  
Graph Modification

Graph Modification for Edge-Coloured and Signed Graph Homomorphism Problems: Parameterized and Classical Complexity

Algorithmica ◽  
2022 ◽  
Author(s):  
Florent Foucaud ◽  
Hervé Hocquard ◽  
Dimitri Lajou ◽  
Valia Mitsou ◽  
Théo Pierron
Keyword(s):  
Signed Graph ◽  
Graph Homomorphism ◽  
Graph Modification

scholarly journals Polynomial kernels for 3-leaf power graph modification problems

2010 ◽  
Vol 158 (16) ◽  
pp. 1732-1744 ◽  
Author(s):  
Stéphane Bessy ◽  
Christophe Paul ◽  
Anthony Perez
Keyword(s):  
Graph Modification ◽  
Power Graph ◽  
Graph Modification Problems ◽  
Polynomial Kernels

scholarly journals A survey of graph-modification techniques for privacy-preserving on networks

2016 ◽  
Vol 47 (3) ◽  
pp. 341-366 ◽  
Author(s):  
Jordi Casas-Roma ◽  
Jordi Herrera-Joancomartí ◽  
Vicenç Torra
Keyword(s):  
Privacy Preserving ◽  
Graph Modification

Graph Modification Approaches

2018 ◽  
pp. 86-115
Keyword(s):  
Social Network ◽  
Random Perturbation ◽  
Graph Modification ◽  
Noise Nodes

This chapter contains some of the most recent techniques and algorithms on social network anonymisation. The authors start with the random perturbation algorithms like the UMGA algorithm and constrained perturbation algorithms like the fast k-degree anonymization (FKDA) algorithm. Then they move to the anonymisation technique, noise nodes addition, and present an algorithm based upon this approach. Next, the authors move on to α-anonymization, (α, k) anonymity, (α, l) diversity, and recursive (α, c, l) diversity anonymisation algorithms, which are generalisations in that order.

Sign in / Sign up

Export Citation Format

Share Document