Motivated by applications to social network analysis (SNA), we study the problem of finding the maximum number of disjoint unicolor paths in an edge-colored graph. We show the NP-hardness and the approximability of the problem, and both approximation and exact algorithms are proposed. Since short paths are much more significant in SNA, we also study the length-bounded version of the problem, in...