Exam (elaborations)
CS 573: Algorithms, Fall 2013
- Course
- Nursing (CS573)
- Institution
- Thompson River University (TRU )
1. Greedy algorithm do not work. (40 pts.) Anaturalalgorithm, GreedyIndep, forcomputingmaximumindependentsetinagraph, istorepeatedly remove the vertex of lowest degree in the graph, and add it to the independent set, and remove all its neighbors. (A) (5 pts.) Show an example, where this algorithm...
[Show more]