Pages that link to "Item:Q2051774"
From MaRDI portal
The following pages link to An improved FPT algorithm for the flip distance problem (Q2051774):
Displaying 6 items.
- Flip distance between two triangulations of a point set is NP-complete (Q906837) (← links)
- Computing the flip distance between triangulations (Q2408209) (← links)
- Flip Distance Is in FPT Time O(n+ k * c^k) (Q2955019) (← links)
- (Q5111282) (← 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)