Pages that link to "Item:Q5327468"
From MaRDI portal
The following pages link to A Refined Complexity Analysis of Degree Anonymization in Graphs (Q5327468):
Displaying 4 items.
- Graphic sequences, distances and \(k\)-degree anonymity (Q2345626) (← links)
- A refined complexity analysis of degree anonymization in graphs (Q2347809) (← links)
- The Complexity of Finding a Large Subgraph under Anonymity Constraints (Q2872080) (← links)
- Privacy in Elections: k-Anonymizing Preference Orders (Q2947888) (← links)