Pages that link to "Item:Q5964077"
From MaRDI portal
The following pages link to Finding large degree-anonymous subgraphs is hard (Q5964077):
Displaying 5 items.
- Win-win kernelization for degree sequence completion problems (Q295647) (← links)
- A parameterized algorithmics framework for degree sequence completion problems in directed graphs (Q1739111) (← links)
- Degree-anonymization using edge rotations (Q2034394) (← links)
- Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics (Q2827798) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)