Q 1 In this question, use the graph in Figure 1 and the initial matching M = {(a, A), (b, B)}. A 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 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'|.
Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
Related questions
Question
Please do the following question with handwritten working out. Please draw 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
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 with 5 images
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
