Q 1 In this question, use the graph in Figure 1 and the initial matching M = {(a, A), (b, B)}. A b d B D Figure 1: Extend this matching (a) Starting from M, find a larger matching (i.e. show M isn't maximal). (b) Starting from M again, transform the graph so that Ford-Fulkerson can be applied and the initial matching M is the initial flow. (c) There are two augmenting paths. Find both. (d) Use the augmenting path involving c to augment the flow. (e) Run Ford-Fulkerson one more time, to find a min-cut. (f) Use the min-cut to identify a vertex cover V of the same size as your maximum-sized matching i.e. |V| = |M'|.
Q 1 In this question, use the graph in Figure 1 and the initial matching M = {(a, A), (b, B)}. A b d B D Figure 1: Extend this matching (a) Starting from M, find a larger matching (i.e. show M isn't maximal). (b) Starting from M again, transform the graph so that Ford-Fulkerson can be applied and the initial matching M is the initial flow. (c) There are two augmenting paths. Find both. (d) Use the augmenting path involving c to augment the flow. (e) Run Ford-Fulkerson one more time, to find a min-cut. (f) Use the min-cut to identify a vertex cover V of the same size as your maximum-sized matching i.e. |V| = |M'|.
Algebra & Trigonometry with Analytic Geometry
13th Edition
ISBN:9781133382119
Author:Swokowski
Publisher:Swokowski
Chapter3: Functions And Graphs
Section3.3: Lines
Problem 13E
Related questions
Question
Please do the following question with handwritten working out. Please make sure a graph for question 1b is drawn where required.
Transcribed Image Text:Q 1 In this question, use the graph in Figure 1 and the initial matching M = {(a, A), (b, B)}.
A
b
d
B
D
Figure 1: Extend this matching
(a) Starting from M, find a larger matching (i.e. show M isn't maximal).
(b) Starting from M again, transform the graph so that Ford-Fulkerson can be applied and
the initial matching M is the initial flow.
(c) There are two augmenting paths. Find both.
(d) Use the augmenting path involving c to augment the flow.
(e) Run Ford-Fulkerson one more time, to find a min-cut.
(f) Use the min-cut to identify a vertex cover V of the same size as your maximum-sized
matching i.e. |V| = |M'|.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
Recommended textbooks for you
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage