Pages that link to "Item:Q763531"
From MaRDI portal
The following pages link to An improved kernel size for rotation distance in binary trees (Q763531):
Displaying 9 items.
- The edge rotation graph (Q367068) (← links)
- Lower bounds on the rotation distance of binary trees (Q1675757) (← links)
- An improved FPT algorithm for the flip distance problem (Q2051774) (← links)
- Computing the flip distance between triangulations (Q2408209) (← links)
- (Q5111282) (← links)
- Kernelization of Whitney Switches (Q5874518) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- An improved kernel for the flip distance problem on simple convex polygons (Q6161439) (← links)
- The rotation distance of brooms (Q6201876) (← links)