Pages that link to "Item:Q5251633"
From MaRDI portal
The following pages link to The Complexity of Degree Anonymization by Vertex Addition (Q5251633):
Displaying 6 items.
- Graph editing to a given degree sequence (Q507592) (← links)
- The complexity of degree anonymization by vertex addition (Q897957) (← links)
- Degree-anonymization using edge rotations (Q2034394) (← links)
- A refined complexity analysis of degree anonymization in graphs (Q2347809) (← links)
- Privacy in Elections: k-Anonymizing Preference Orders (Q2947888) (← links)
- Graph Editing to a Given Degree Sequence (Q5740185) (← links)
