Pages that link to "Item:Q2946009"
From MaRDI portal
The following pages link to Parameterized Inapproximability of Degree Anonymization (Q2946009):
Displaying 5 items.
- The complexity of degree anonymization by vertex addition (Q897957) (← links)
- A refined complexity analysis of degree anonymization in graphs (Q2347809) (← links)
- The complexity of degree anonymization by graph contractions (Q2407102) (← links)
- Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack (Q5075797) (← links)
- Finding large degree-anonymous subgraphs is hard (Q5964077) (← links)
