The following pages link to (Q5111282):
Displaying 5 items.
- Flip distance between two triangulations of a point set is NP-complete (Q906837) (← links)
- An improved FPT algorithm for the flip distance problem (Q2051774) (← links)
- Computing the flip distance between triangulations (Q2408209) (← links)
- Flip distance between triangulations of a planar point set is APX-hard (Q2444311) (← links)
- Flip Distance Is in FPT Time O(n+ k * c^k) (Q2955019) (← links)