# HW8_Sol.pdf - CSCI 570 Spring 2018 HW 8 due 1 Graded...

• Homework Help
• 3
• 100% (1) 1 out of 1 people found this document helpful

This preview shows pages 1–2. Sign up to view the full content.

CSCI 570 - Spring 2018 - HW 8 due MARCH 23, 2018 1 Graded Problems 1. The edge connectivity of an undirected graph is the minimum number of edges whose removal disconnects the graph. Describe an algorithm to com- pute the edge connectivity of an undirected graph with n vertices and m edges in O ( m 2 n ) time. For a cut ( S, ¯ S ), let c ( S, ¯ S ) denote the number of edges crossing the cut. By definition, the edge connectivity k = min S V c ( S, ¯ S ) Fix a vertex u V . For every cut ( S, ¯ S ), there is a vertex v V such that u and v are on either side of the cut. Let C u,v denote the value of the min u - v cut. Thus k = min v V,v 6 = u C u,v For each v 6 = u , C u,v can be determined by computing the max flow from u to v . Since G is undirected, we need to implement an undirected variant of the max flow algorithm. Set all edge capacities to 1. During each step of the flow computation, search for an undirected augmenting path using breadth first search and send a flow of 1 through this path. There are n - 1 flow computations and each flow computation takes at most O ( m 2 ) time. 2. Solve Kleinberg and Tardos, Chapter 7, Exercise 7. Let s be a source vertex and t a sink vertex. Introduce a vertex for every base station and introduce a vertex for every client.

This preview has intentionally blurred sections. Sign up to view the full version.

This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern