Conditions for Unique Graph Realizations
The Complexity of the Lin–Kernighan Heuristic for the Traveling Salesman Problem