Given a weighted digraph with positive and negative edge weights, what is the complexity of finding the shortest (uses the least number of edges) negative weight cycle in the graph?
I know that I can detect negative weight cycles using Bellman-Ford. Has this variation be studied before? Can you point me to a reference?