This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CS 473: Fundamental Algorithms, Spring 2012 Homework 1 (due Tuesday, 23:55:00, January 31, 2012) This homework contains three problems. Read the instructions for submitting the home- work on the course webpage . Read the course policies before starting the homework. Collaboration Policy: For this homework, Problems 1–3 can be worked in groups of up to three students. Each student individually have to also do quiz 1 online. Submission guidelines: For every group of students, one and only one student have to upload the solutions to the homework to the class moodle page. Together with the solutions to the three questions, the submitting student of the group also have to upload a text file that contains the netid of the submitting students. Specifically, this text file should be named group.txt . Each student netid (and nothing else) would be written as is on each line of this text file. As such, an example such file might look like: eric2 jeff7 cheng27 Version: 2.11 1. ( 45 pts. ) Briges and cut vertices. b c d e f g h i j k l p q r s t 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...
View Full Document
This note was uploaded on 04/02/2012 for the course CS 473 taught by Professor Chekuri,c during the Spring '08 term at University of Illinois, Urbana Champaign.
- Spring '08