# H3-ie514 - i if activity a i is selected then it must start...

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

Homework #3 Due: March 9, 2010 1) Let G = (V;E) be an undirected graph with n vertices and m edges. Show that if every vertex has at least n/2 edges, then the graph is connected. You may assume that n is even. As a hint, think about cuts in the graph. 2) S denotes a set of n activities {a 1 , a 2 , . . . , a n }. Associated with activity a i are its start time s i and finish time f
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: i ; if activity a i is selected then it must start at s i and finish before f i . Two activities a i and a j are compatible, if s i ≥ f j or s j ≥f i ; otherwise, they are conflicting. Design an algorithm that outputs a maximal set of compatible activities. What is the running time of your algorithm? 3)-6): AMO 2.26, 2.38, 3.10, 3.44...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online