Fig. 3
From: On the parameterized complexity of the median and closest problems under some permutation metrics
The permutation graph of \([2\,\,4\,\,3\,\,5\,\,1]\), where each edge is an inversion and the short-block-move distance is equal to the lower bound of \(\lceil \frac{|E^p_\pi |}{2}\rceil = 3\). The hop t(3, 5, 6) is a correcting move obtaining the permutation \([2\,\,4\,\,1\,\,3\,\,5]\)