Pages that link to "Item:Q2347809"
From MaRDI portal
The following pages link to A refined complexity analysis of degree anonymization in graphs (Q2347809):
Displaying 11 items.
- Win-win kernelization for degree sequence completion problems (Q295647) (← links)
- Graph editing to a given degree sequence (Q507592) (← links)
- Differential privacy in probabilistic systems (Q529047) (← links)
- The complexity of degree anonymization by vertex addition (Q897957) (← links)
- A parameterized algorithmics framework for degree sequence completion problems in directed graphs (Q1739111) (← links)
- Degree-anonymization using edge rotations (Q2034394) (← links)
- The complexity of degree anonymization by graph contractions (Q2407102) (← links)
- Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics (Q2827798) (← links)
- Graph Editing to a Given Degree Sequence (Q5740185) (← links)
- Finding large degree-anonymous subgraphs is hard (Q5964077) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
