Pages that link to "Item:Q1917249"
From MaRDI portal
The following pages link to Finding Hamiltonian cycles in Delaunay triangulations is NP-complete (Q1917249):
Displaying 5 items.
- Matching points with squares (Q1006403) (← links)
- Graph-theoretical conditions for inscribability and Delaunay realizability (Q1356410) (← links)
- Forest-like abstract Voronoi diagrams in linear time (Q1699286) (← links)
- Novel concave hull-based heuristic algorithm for TSP (Q2139346) (← links)
- The number of defective colorings of graphs on surfaces (Q3174242) (← links)
