Next: MINIMUM POINT-TO-POINT CONNECTION
Previous: LONGEST PATH WITH FORBIDDEN
pairs of vertices from V, an initial vertex ,
and a final vertex
A simple path from s to f in G that contains at most one vertex from
each pair in C.
Length of the path, i.e., the number of edges in the path.
- Bad News:
NPO PB-complete .
Transformation from SHORTEST COMPUTATION.