7.24. Direct bipartite matching. We've seen how to find a maximum matching in a bipartite graph...
Fantastic news! We've Found the answer you've been seeking!
Question:
Transcribed Image Text:
7.24. Direct bipartite matching. We've seen how to find a maximum matching in a bipartite graph via reduction to the maximum flow problem. We now develop a direct algorithm. Let G = (V₁UV2, E) be a bipartite graph (so each edge has one endpoint in V₁ and one endpoint in V2), and let M = E be a matching in the graph (that is, a set of edges that don't touch). A vertex is said to be covered by M if it is the endpoint of one of the edges in M. An alternating path is a path of odd length that starts and ends with a non-covered vertex, and whose edges alternate between M and E - M. (a) In the bipartite graph below, a matching M is shown in bold. Find an alternating path. E A F B G H Ꭰ I (b) Prove that a matching M is maximal if and only if there does not exist an alternating path with respect to it. (c) Design an algorithm that finds an alternating path in O(|V| + |E|) time using a variant of breadth-first search. (d) Give a direct O(|V|· |E|) algorithm for finding a maximal matching in a bipartite graph. 7.24. Direct bipartite matching. We've seen how to find a maximum matching in a bipartite graph via reduction to the maximum flow problem. We now develop a direct algorithm. Let G = (V₁UV2, E) be a bipartite graph (so each edge has one endpoint in V₁ and one endpoint in V2), and let M = E be a matching in the graph (that is, a set of edges that don't touch). A vertex is said to be covered by M if it is the endpoint of one of the edges in M. An alternating path is a path of odd length that starts and ends with a non-covered vertex, and whose edges alternate between M and E - M. (a) In the bipartite graph below, a matching M is shown in bold. Find an alternating path. E A F B G H Ꭰ I (b) Prove that a matching M is maximal if and only if there does not exist an alternating path with respect to it. (c) Design an algorithm that finds an alternating path in O(|V| + |E|) time using a variant of breadth-first search. (d) Give a direct O(|V|· |E|) algorithm for finding a maximal matching in a bipartite graph.
Expert Answer:
Answer rating: 100% (QA)
The skin friction coefficient Cf for a laminar boundary ... View the full answer
Related Book For
Data Structures and Algorithm Analysis in Java
ISBN: 978-0132576277
3rd edition
Authors: Mark A. Weiss
Posted Date:
Students also viewed these programming questions
-
The following data represent the responses to two questions asked in a survey of 40 college students majoring in business: What is your gender? (M = male; F = female) and What is your major? (A =...
-
If you were to invest $2,000 each year for the next 35 years, then what rate of return is required for your investment to be worth $2,000,000? (Assume the first payment will begin one year from...
-
Managing Scope Changes Case Study Scope changes on a project can occur regardless of how well the project is planned or executed. Scope changes can be the result of something that was omitted during...
-
Explain why a safety net can save the life of a circus performer.
-
If a nurse deposits $1,000 today in a bank account and the interests is compounded annually at 12 percent, what will be the value of this investment? Five years from now? Ten years from now? Fifteen...
-
What is the production effect of a tariff? How would you describe it in words, without reference to any diagram or numbers? How would you show it on a diagram, and how would you compute its value?
-
Harry Hernandez has \($60,000\) this year. He faces the investment opportunities represented by point B in the following figure. He wants to consume \($20,000\) this year and \($67,500\) next year....
-
Several years ago Brant, Inc., sold $900,000 in bonds to the public. Annual cash interest of 9 percent ($81,000) was to be paid on this debt. The bonds were issued at a discount to yield 12 percent....
-
The ABC company has been in business for over 40years. Sales hasbeen consistent for the last 10 years at $2.1m annually. Inaddition, the Gross margin has been consistent at 60%. Costs wereall consi 2...
-
Use INDEX and MATCH functions to fill in a table that extracts the amounts shipped between each pair of cities in the accompanying data, which shows the solution to an optimization model that finds...
-
Full Ltd acquired 80% of the share capital of Partial Ltd on 1 July 2015 for $350 000, when all assets of Partial Ltd were fairly valued. Additional information: 1. Share capital and reserves are:...
-
Find the consumers' surplus at a price level of p = $7 for the price-demand equation p=D(x)=25-0.4x.
-
(A) Briefly describe (i) the monetary, or asset market approach to exchange rate determination and (ii) the Keynesian trade flow model of exchange rate determination. What are key differences between...
-
Explainn briefly the following Questions. in ur own words 1. Is safer to invest in stocks than bonds? Why or why not? 2. What is the difference between investing and gambling? 3. Askk yourself, if it...
-
a.GenTech Ltd needs to save $50 million to expand its production lines in six years' time. There are three investment options to consider: ABC bank: monthly payments due at the end of each month.The...
-
Identify and describe at least Ten (10) Business and Professional Services and Seven (7) Not for profit Service providers within Zambia for which their products would be considered Services
-
Brewing Tea ~ A tea manufacturer claims that their green tea bags contain 2.7 grams of tea per bag. The new factory manager tests this claim by randomly sampling 9 tea bags and weighing their...
-
Suppose that the laptop of Prob. 2.16 is placed in an insulating briefcase with a fully charged battery, but it does not go into sleep mode, and the battery discharges as if the laptop were in use....
-
The baseball card collector problem is as follows: Given packets P1, P2, . . . , PM, each of which contains a subset of the year's baseball cards, and an integer K, is it possible to collect all the...
-
If the recursive routine in Section 2.4 used to compute Fibonacci numbers is run for N = 50, is stack space likely to run out? Why or why not?
-
Two 7070 matrices can be multiplied using 143,640 multiplications. Show how this can be used to improve the bound given by Strassen's algorithm.
-
Another population model is one in which species compete for resources, such as a limited food supply. Such a model is given by \[\begin{aligned} & x^{\prime}=a x-b x^{2}-c x y \\ & y^{\prime}=d y-e...
-
Consider the period of a nonlinear pendulum. Let the length be \(L=1.0\) \(\mathrm{m}\) and \(g=9.8 \mathrm{~m} / \mathrm{s}^{2}\). Sketch \(T\) versus the initial angle \(\theta_{0}\), and compare...
-
Derive the first integral of the Lotka-Volterra system, \(a \ln y+d \ln x-\) \(c x-b y=C\).
Study smarter with the SolutionInn App