hw1 - CS 473: Algorithms, Fall 2010 HW 1 (due Tuesday,...

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

View Full Document Right Arrow Icon

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

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: CS 473: Algorithms, Fall 2010 HW 1 (due Tuesday, September 7th) 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. Write your name and netid on each sheet. Collaboration Policy: For this home work, Problems 2-4 can be worked in groups of up to 3 students each. Problem 1 should be answered in Compass as part of the assessment HW1-Online and should be done individually. 1. (15 pts) Short questions to be answered on compass individually. 2. (10 pts) Let s,t be two nodes in an undirected graph G such that the distance between them (in terms of number of edges) is strictly greater than n/ 2; here n is the number of nodes in G . Show that there is a node v such that all s- t paths contain v . 3. (45 pts) Given a connected undirected graph G = ( V,E ), an edge e = ( u,v ) is called a bridge , or a cut-edge , if removing e disconnects the graph into two pieces, one containing...
View Full 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.

Page1 / 2

hw1 - CS 473: Algorithms, Fall 2010 HW 1 (due Tuesday,...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online