Alice, Bob and you have been studying graph algorithms. You understand the reduction between Independent Set...
Fantastic news! We've Found the answer you've been seeking!
Question:
Transcribed Image Text:
Alice, Bob and you have been studying graph algorithms. You understand the reduction between Independent Set and Clique quite well but are now considering another of Karp's 21 Problems. A vertex cover is a set of vertices in a graph such that every edge in the graph has at least one end point in the set. That is, no edge is left uncovered with both of its endpoints not in the set. Vertex Cover (VC) Input: G= (V,E) a undirected graph and k0. Output: "yes" if there exists a set of vertices V' of size k such that every edge has at least one endpoint in V', "no" otherwise. a) (2 points) What is the size of the smallest vertex cover on this graph? b) (2 points) You want to show that Vertex Cover is in NP so you will create a verifica- tion algorithm. What type of proof would you accept to convince you that there is a vertex cover of size k? c) (3 points) Give pseudocode for a verification procedure for Vertex Cover. d) (3 points) Argue your verification procedure is correct for Vertex Cover. e) (5 points) Show that Vertex Cover is NP-complete by reducing one of Clique or Independent Set to Vertex Cover. That is, show that A p Vertex Cover for your choice of problem A. Alice, Bob and you have been studying graph algorithms. You understand the reduction between Independent Set and Clique quite well but are now considering another of Karp's 21 Problems. A vertex cover is a set of vertices in a graph such that every edge in the graph has at least one end point in the set. That is, no edge is left uncovered with both of its endpoints not in the set. Vertex Cover (VC) Input: G= (V,E) a undirected graph and k0. Output: "yes" if there exists a set of vertices V' of size k such that every edge has at least one endpoint in V', "no" otherwise. a) (2 points) What is the size of the smallest vertex cover on this graph? b) (2 points) You want to show that Vertex Cover is in NP so you will create a verifica- tion algorithm. What type of proof would you accept to convince you that there is a vertex cover of size k? c) (3 points) Give pseudocode for a verification procedure for Vertex Cover. d) (3 points) Argue your verification procedure is correct for Vertex Cover. e) (5 points) Show that Vertex Cover is NP-complete by reducing one of Clique or Independent Set to Vertex Cover. That is, show that A p Vertex Cover for your choice of problem A.
Expert Answer:
Related Book For
Fundamentals of Financial Accounting
ISBN: 978-0078025914
5th edition
Authors: Fred Phillips, Robert Libby, Patricia Libby
Posted Date:
Students also viewed these computer network questions
-
CANMNMM January of this year. (a) Each item will be held in a record. Describe all the data structures that must refer to these records to implement the required functionality. Describe all the...
-
"internet radios" for streaming audio, and personal video recorders and players. Describe design and evaluation processes that could be used by a start-up company to improve the usability of such...
-
Marty owns an auto body repair shop. The business has no real value without him and the building is pretty much a mess after being full of paint fumes for all those years but the land is worth...
-
In a fixed-target experiment, high-energy charged particles from an accelerator are smashed into a stationary target. By contrast, in a colliding beam experiment, two beams of particles are...
-
At this point in your collegiate career, youve developed areas of academic expertise that could benefit other students. After kicking around moneymaking ideas with friends, you decide that the...
-
If your instructor assigns a marketing plan for your class, we hope you will be excitedfor two reasons. First, you will get insights into trying to actually do marketing that often go beyond what you...
-
Pharmahelp, Inc., a distributor of special pharmaceutical products, operates at capacity and has three main market segments: a. General supermarket chains b. Drugstore chains c. Mom-and-pop...
-
Explain entity integrity and referential integrity rules in relational model. Show how these are realized in SQL.
-
Two solid spheres of radius Rand mass m are initially separated by a distance d such that the two centres of mass are separated by d+2R as shown below. The spheres are initially at rest, but the...
-
The income statement line gross profit will appear on which income statement format? O a. Multiple-step O b. Single-step
-
Oa. Equity -are cash and other assets expected to be converted to cash, sold, or consumed either in a year. O b. Non current liabilities Oc Current assets Od. Current liabilities Oe. Non current...
-
Your corporate client wants to issue 100-year bonds . The corporation 's CEO reads The Wall Street Journal regularly and has observed that similar bonds have been issued by several companies,...
-
Sketch a complete free body diagram of each link of the mechanism illustrated in figure below. Determine the Torque required to be applied to the link AB for equilibrium? 200 N 300 300 D 400 A 120 C...
-
get Clara to create a checkerboard pattern of leaves inside an empty rectangular world (Figure 4.1), and produce the world similar to what is shown in Figure 4.2. Figure 4.1. Initial screen Practical...
-
Which of the following is the most likely result in regard to Bruces claim that the lawsuit could only be appropriately filed in a state court? A. The court would likely rule that federal court...
-
Borrowing costs should be recognised as an expense and charged to the profit and loss account of the period in which they are incurred : A. If the borrowing costs relate to qualifying asset B. If the...
-
Reconsider the data from Problem 57 (Orpheum Productions lighting enhancement). Assume that any money not invested in the lighting enhancements will be placed in an interest-bearing account earning...
-
An investor has \($100,000\) to invest in a business venture, or she can earn 10 percent/year with a \($100,000\) certificate of deposit for 4 years. Three possible business ventures have been...
-
This problem is related to Problem 8. Jeff has $10,000 to invest for a period of 5 years. The following three alternatives are available at his bank: Data from problem 8 Jeff has $10,000 to invest...
Study smarter with the SolutionInn App