Pages that link to "Item:Q2444311"
From MaRDI portal
The following pages link to Flip distance between triangulations of a planar point set is APX-hard (Q2444311):
Displaying 15 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)
- Arc diagrams, flip distances, and Hamiltonian triangulations (Q1699291) (← links)
- Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees (Q2032154) (← links)
- An improved FPT algorithm for the flip distance problem (Q2051774) (← links)
- Minimum weight connectivity augmentation for planar straight-line graphs (Q2272377) (← links)
- Introduction to reconfiguration (Q2331456) (← links)
- Computing the flip distance between triangulations (Q2408209) (← links)
- A proof of the orbit conjecture for flipping edge-labelled triangulations (Q2415384) (← links)
- Shortest Reconfiguration of Perfect Matchings via Alternating Cycles (Q5074950) (← links)
- (Q5111282) (← links)
- Transition operations over plane trees (Q5918848) (← links)
- Complexity results on untangling red-blue matchings (Q6101837) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- The rotation distance of brooms (Q6201876) (← links)
