Pages that link to "Item:Q2354405"
From MaRDI portal
The following pages link to Editing to a graph of given degrees (Q2354405):
Displaying 15 items.
- Win-win kernelization for degree sequence completion problems (Q295647) (← links)
- Graph editing to a given degree sequence (Q507592) (← links)
- Graph editing problems with extended regularity constraints (Q526874) (← links)
- Editing to a planar graph of given degrees (Q730508) (← links)
- Editing to Eulerian graphs (Q896016) (← links)
- A parameterized algorithmics framework for degree sequence completion problems in directed graphs (Q1739111) (← links)
- Editing to a graph of given degrees (Q2354405) (← links)
- Fixed-parameter tractable distances to sparse graph classes (Q2408199) (← links)
- (Q2946019) (redirect page) (← links)
- Editing to a Planar Graph of Given Degrees (Q3194713) (← links)
- (Q5089202) (← 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)
- Trimming forests is hard (unless they are made of stars) (Q6654119) (← links)
