摘要： 34.1-1:Assumption: the graph is unweightedLONGEST-PATH-LENGTH ∈P=> LONGEST-PATH∈P:Suppose there's a problem solves LHS in polynomial time, gives result k; then for the problem of RHS, it returns true if the given k' <= k.LONGEST-PATH∈P:=> LONGEST-PATH-LENGTH ∈P:Guess the k to the po 阅读全文