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
- Spring '10
- Graph Theory, undirected graph, time si