Pages that link to "Item:Q2955019"
From MaRDI portal
The following pages link to Flip Distance Is in FPT Time O(n+ k * c^k) (Q2955019):
Displaying 8 items.
- On the parameterized complexity of reconfiguration of connected dominating sets (Q832526) (← links)
- Flip distance between triangulations of a simple polygon is NP-complete (Q894685) (← links)
- An improved FPT algorithm for the flip distance problem (Q2051774) (← links)
- Flip distance to some plane configurations (Q2331207) (← links)
- Introduction to reconfiguration (Q2331456) (← links)
- Computing the flip distance between triangulations (Q2408209) (← links)
- (Q5111282) (← links)
- (Q6089671) (← links)