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 V), 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. A B D E F 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 V), 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. A B D E F 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)
a To find an alternating path in the bipartite graph with the given matching M we can start at a noncovered vertex and traverse edges alternately betw... 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.
-
The large compressed-air tank in Fig P9.32 exhausts from a nozzle at an exit velocity of 235 m/s. The mercury manometer reads h = 30 cm. Assuming isentropic flow, compute the pressure (a) In the tank...
-
Determine the coefficient of x9y3 in the expansions of (a) (x + y)12 (b) (x + 2y)12 (c) (2x - 3y)12.
-
During the 2002 Winter Olympics in Salt Lake City, Utah, a local microbrewery received a rush order for 100 gallons of beer containing at least 4.0 volume \(\%\) alcohol. Although no \(4 \%\) beer...
-
Hayes Enterprises began 2012 with a retained earnings balance of $928,000. During 2012, the firm earned $377,000 after taxes. From this amount, preferred stockholders were paid $47,000 in dividends....
-
How does a community service review and revise their work practices following feedback from the community? How would you revise the work delivered if social and cultural issues were not being...
-
What size loan must we take today with a 6% compound interest rate to have end-of-year payments of $1400, $1320, $1240, $1160, and $1080 for the next five years, respectively? In other words, if you...
-
Prepare journal entries to record the following Lowe's business transactions, which uses the perpetual inventory system and the gross method. (Hint: It will help identify each account receivable and...
-
Month Zemin Corp. Market 1 8 % 5 % 2 5 4 3 0 2 4 4 1 5 6 4 6 3 3 (CAPM and expected returns) a. Given the following holding-period returns, LOADING... , compute the average returns and the standard...
-
Two 9-year-old boys are watching a television replay of a boxing match between Muhammad Ali and Joe Frazier on a program called Great Fights of the Century. Since the fight took place before they...
-
What is the main jobs and priorities of a Health policy consultant? provide one reference with in-text citation
-
In 1995, O.J. Simpson was found not-guilty in the murder of Nicole Brown-Simpson. However, he was found guilty in a civil case. Why? Explain the differences between criminal and civil cases?
-
QUESTION TWO 2.1 Communication planning is very important in project management. Discuss communication planning with reference to the above case study. 2.2 Referring to the case study, discuss the...
-
Brewer, Inc. sells two products, Product A and Product B. The following data relate to expected sales for the coming period: Product A Product B Sales units 30,000 70,000 Sales revenue $360,000...
-
Prove that the mean heat capacities C P H and C P S are inherently positive, whether T > T 0 or T < T 0 . Explain why they are well defined for T = T 0 .
-
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.
-
The two transistors in Figure P32.26 are connected to each other by wires and also connected to input wires at terminals \(\mathrm{A}\) and \(\mathrm{B}\). The output of this combination depends on...
-
Is the light bulb in Figure P32.27 lit? Data from Figure P32.27 (e)
-
Which circuit in Figure P32.25 produces the greatest current in the emitter? Data from Figure P32.25 A B n-type p-type n-type n-type p-type n-type C n-type p-type n-type HHHHH
Study smarter with the SolutionInn App