Question: Question #4 Consider the graph shown below with matching shown by the dashed lines. (11) a. Specify an alternating path of length 7. b.
Question #4 Consider the graph shown below with matching shown by the dashed lines. (11) a. Specify an alternating path of length 7. b. Using the labeling algorithm, find a blossom starting at vertex 10. c. Using the M-augmenting path algorithm, find a maximum matching. d. Policemen's problem: Suppose the graph above represents the street map of a small town. A policeman standing in the middle of a street can survey the crossings at the two ends of the street. What is the smallest number of policemen needed to survey all the crossings in the network?
Step by Step Solution
3.42 Rating (161 Votes )
There are 3 Steps involved in it
a An alternating path of length 7 is 12468107531 b Starting at vertex 10 the bblossom can be f... View full answer
Get step-by-step solutions from verified subject matter experts
