Given a graph with n nodes there are a number of serial methods of increasing sophistication and reducing complexity for finding simple paths of length k in a graph. The best known asymptotic complexity is currently O(2^k poly(n,k)) time. A naive algorithm on the other hand just enumerates all paths of length k and takes O(n^k) time (at least).

How could you translate the naive algorithm to work efficiently in the MapReduce paradigm? Are there existing libraries for this sort of thing?