Given a graph G(V,E) and a vertex v, how do i find all the vertices that are reachable via simple paths ( no vertex on the path repeats) of length exactly k.
Powers of adjacency matrix gives the number of paths between vertices but it includes non simple paths.
Is this problem solvable in polynomial time ? If not are there any known approximation algorithms. Any pointers to literature would be great.