in B^ x G2. The admissible paths q e Q are obtained in the following way: Let p^ be an admissible path of connecting x. e A. to y. £ B. (i = 1,2,3) and suppose t(x3) = y . Then P1 X X2 ends at ^yi'X2^ ' yi x P2 begins at (y1»*2) and ends at (y1»y2); and P3 X y2 begins at (x3,y2> = *yi'y2** The path… … The lines do not represent edges; instead they connect vertices which are to be identified.
Kleinrock, Leonard · California univ los angeles dept of computer science · Computers · Communications networks · Data transmission systems · Mathematical models · Mathematical programming · Network flows · Networks · Satellite communications · Switching circuits
Internet Archive · Defense Technical Information Center · Public domain (US government work). Free to use for anything.
