Consider the following problem: given an undirected graph with weighted edges (positive and negative) I would like to know if there is a k-length acyclic path with negative weight. Is there an algorithm for that with a good complexity? Maybe I can find the lighter k-length acyclic path and check if is negative, but it could be that this approach may have a bigger complexity. Let me know what do you think.
(Sorry for the lousy english)