Pages that link to "Item:Q894685"
From MaRDI portal
The following pages link to Flip distance between triangulations of a simple polygon is NP-complete (Q894685):
Displaying 24 items.
- Flip distance between triangulations of a simple polygon is NP-complete (Q894685) (← links)
- Flip distance between two triangulations of a point set is NP-complete (Q906837) (← links)
- Flipping in spirals (Q1984590) (← links)
- An improved FPT algorithm for the flip distance problem (Q2051774) (← links)
- Disjoint compatibility graph of non-crossing matchings of points in convex position (Q2263780) (← links)
- Convex dominating sets in maximal outerplanar graphs (Q2312656) (← links)
- Flip distance to some plane configurations (Q2331207) (← links)
- Computing the flip distance between triangulations (Q2408209) (← links)
- A proof of the orbit conjecture for flipping edge-labelled triangulations (Q2415384) (← links)
- Flip distance between triangulations of a planar point set is APX-hard (Q2444311) (← links)
- (Q2849292) (redirect page) (← links)
- Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas (Q3448854) (← links)
- Shortest Reconfiguration of Perfect Matchings via Alternating Cycles (Q5074950) (← links)
- The Perfect Matching Reconfiguration Problem (Q5092444) (← links)
- (Q5111282) (← links)
- Flip Distance to some Plane Configurations. (Q5116475) (← links)
- Planar 3-SAT with a clause/variable cycle (Q5116495) (← links)
- Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas (Q5361235) (← links)
- On flips in planar matchings (Q5919054) (← links)
- Flip distances between graph orientations (Q5919075) (← links)
- Flip paths between lattice triangulations (Q6090067) (← links)
- Complexity results on untangling red-blue matchings (Q6101837) (← links)
- An improved kernel for the flip distance problem on simple convex polygons (Q6161439) (← links)
- The rotation distance of brooms (Q6201876) (← links)
