Given a directed graph G= (V,E), a pair of vertices s and t, a natural number K encoded in binary, whether the problem to decide there exists a path (not necessarily simple) from s to t of length K is NP-complete ?
closed as off-topic by Jan Johannsen, Emil Jeřábek, D.W., Aryeh, Kristoffer Arnsfelt Hansen Apr 16 '18 at 12:05
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "Your question does not appear to be a research-level question in theoretical computer science. For more information about the scope, please see help center. Your question might be suitable for Computer Science which has a broader scope." – Jan Johannsen, Emil Jeřábek, D.W., Aryeh, Kristoffer Arnsfelt Hansen