  Time delays may cause dramatic changes to the dynamics of interacting
oscillators. Coupled networks of interacting dynamical systems can behave
unexpectedly when the signal between the vertices are time delayed. It has been
shown for a very general class of systems that the time delays can be
rearranged as long as the total time delay over the constitutive loops of the
network is conserved. This fact allows to reduce the number of time delays of
the problem without loss of information. There is a theoretical lower bound for
this number, but in many cases we can find a numerical solution that beats this
limit. Here we propose a formulation of the problem and a numerical method to
even further reduce the number of time delays in a network.
