Before revision:  While k-IP can be solved in polynomial time for k <= 2, we show k-IP is NP-complete for k >= 3. Further, we show that k-IP remains NP-complete for k >= 3 even for the case when G is a DAG.
After revision:  While k-IP can be solved in polynomial time for k <= 2, we show k-IP is NP-complete for k >= 3 even for the case when G is a DAG.