Pages that link to "Item:Q2872080"

The following pages link to The Complexity of Finding a Large Subgraph under Anonymity Constraints (Q2872080):

Displaying 9 items.

• The anonymous subgraph problem (Q340300) (← links)
• Graph editing to a given degree sequence (Q507592) (← links)
• The complexity of degree anonymization by vertex addition (Q897957) (← links)
• De-anonymization of heterogeneous random graphs in quasilinear time (Q1755750) (← links)
• A refined complexity analysis of degree anonymization in graphs (Q2347809) (← links)
• The complexity of degree anonymization by graph contractions (Q2407102) (← links)
• On the computational complexities of three problems related to a privacy measure for large networks under active attack (Q2419112) (← links)
• Graph Editing to a Given Degree Sequence (Q5740185) (← links)
• Finding large degree-anonymous subgraphs is hard (Q5964077) (← links)