Pages that link to "Item:Q2407102"
From MaRDI portal
The following pages link to The complexity of degree anonymization by graph contractions (Q2407102):
Displaying 6 items.
- The complexity of degree anonymization by vertex addition (Q897957) (← links)
- 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)
- The Complexity of Degree Anonymization by Vertex Addition (Q5251633) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)