A numerical approach to long cycles in graphs and digraphs Original Research Article

We present a simple numerical method for computing the minimal negativity over all cycles in an ordered digraph. Minimizing over all orderings leads then to the maximal cycle in the digraph.