Key points are not available for this paper at this time.
The diameter of a directed graph is a fundamental parameter defined as the maximum distance realized among the pairs of vertices. As graphs of small diameter are of interest in many applications, we study the following problem: for a given directed graph and a positive integer d, what is the minimum number of arc flips (also known as arc reversal) required to obtain a graph with diameter at most d? It is a generalization of the well-known problem Oriented Diameter, first studied by Chv\'atal and Thomassen. Here we investigate variants of the above problem, considering the number of flips and the target diameter as parameters. We prove that most of the related questions of this type are hard. Special cases of graphs are also considered, as planar and cactus graphs, where we give polynomial time algorithms.
Gehér et al. (Fri,) studied this question.