Pages that link to "Item:Q897957"
From MaRDI portal
The following pages link to The complexity of degree anonymization by vertex addition (Q897957):
Displaying 8 items.
- KDVEM: a \(k\)-degree anonymity with vertex and edge modification algorithm (Q904120) (← links)
- A refined complexity analysis of degree anonymization in graphs (Q2347809) (← links)
- The complexity of degree anonymization by graph contractions (Q2407102) (← links)
- Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics (Q2827798) (← links)
- The Complexity of Finding a Large Subgraph under Anonymity Constraints (Q2872080) (← links)
- The Complexity of Degree Anonymization by Vertex Addition (Q5251633) (← links)
- Finding large degree-anonymous subgraphs is hard (Q5964077) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)