hw9 - CS 473: Algorithms, Fall 2010 HW 9 (due Tuesday,...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 473: Algorithms, Fall 2010 HW 9 (due Tuesday, November 16) This homework contains four problems. Read the instructions for submitting homework on the course webpage . In particular, make sure that you write the solutions for the problems on separate sheets of paper; the sheets for each problem should be stapled together. Write your name and netid on each sheet. Collaboration Policy: For this home work, Problems 1-3 can be worked in groups of up to 3 students each. Problem 0 should be answered in Compass as part of the assessment HW9-Online and should be done individually. 0. (10 pts) HW9-Online on Compass. 1. (25 pts) Given an undirected graph G = ( V,E ) and two distinct nodes s,t describe an algorithm that decides if there are k internally node-disjoint paths between s and t . Two s - t paths P and Q are internally node-disjoint if they do not share any nodes other than s and t . 2. (35 pts) Let G = ( V,E ) be a flow network with source s and sink t . Describe a polynomial time algorithm to check if
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/22/2011 for the course CS 473 taught by Professor Chekuri,c during the Fall '08 term at University of Illinois, Urbana Champaign.

Ask a homework question - tutors are online