Diameter Reduction Via Flipping Arcs
Diameter Reduction Via Flipping Arcs
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 …