Figure 9.1: A path P with a minimal P(vi,vj)-shortcut Q. Q0 is a non-minimal shortcut. Vertices vi and vj are fork and join vertices of Q, respectively and the marked vertices are the bypassed vertex set B(Q).
Figure 9.1: A path P with a minimal P(vi,vj)-shortcut Q. Q0 is a non-minimal shortcut. Vertices vi and vj are fork and join vertices of Q, respectively and the marked vertices are the bypassed vertex set B(Q).