Given a graph G find the maximum number of k-disjoint paths from src to destination. Definition of k-disjoing paths is as follows:

Two paths are k-disjoint if they share atmost k-edges.

I have tried this problem but I have no solution for this as of now. If anyone can come up with a solution let me know.